/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:29:20,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:29:20,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:29:20,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:29:20,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:29:20,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:29:20,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:29:20,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:29:20,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:29:20,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:29:20,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:29:20,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:29:20,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:29:20,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:29:20,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:29:20,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:29:20,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:29:20,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:29:20,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:29:20,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:29:20,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:29:20,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:29:20,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:29:20,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:29:20,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:29:20,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:29:20,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:29:20,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:29:20,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:29:20,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:29:20,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:29:20,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:29:20,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:29:20,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:29:20,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:29:20,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:29:20,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:29:20,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:29:20,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:29:20,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:29:20,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:29:20,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-02-10 19:29:20,635 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:29:20,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:29:20,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:29:20,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:29:20,637 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:29:20,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:29:20,637 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:29:20,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:29:20,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:29:20,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:29:20,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:29:20,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:29:20,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:29:20,638 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:29:20,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:29:20,639 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:29:20,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:29:20,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:29:20,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:29:20,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:29:20,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:29:20,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:29:20,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:29:20,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:29:20,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:29:20,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:29:20,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:29:20,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:29:20,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:29:20,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:29:20,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:29:20,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:29:20,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:29:20,940 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:29:20,941 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:29:20,942 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl [2020-02-10 19:29:20,943 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl' [2020-02-10 19:29:20,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:29:20,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:29:20,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:29:20,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:29:20,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:29:21,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:29:21,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:29:21,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:29:21,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:29:21,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... [2020-02-10 19:29:21,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:29:21,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:29:21,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:29:21,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:29:21,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:29:21,148 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:29:21,149 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:29:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:29:21,151 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:29:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:29:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:29:21,151 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:29:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:29:21,152 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:29:21,152 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:29:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:29:21,152 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:29:21,153 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:29:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:29:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:29:21,153 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_9 given in one single declaration [2020-02-10 19:29:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure set_9 [2020-02-10 19:29:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure set_9 [2020-02-10 19:29:21,154 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:29:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:29:21,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:29:21,155 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:29:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:29:21,156 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:29:21,156 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 19:29:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 19:29:21,157 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 19:29:21,158 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 19:29:21,158 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 19:29:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 19:29:21,159 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 19:29:21,159 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 19:29:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 19:29:21,160 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 19:29:21,469 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:29:21,469 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:29:21,486 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:29:21 BoogieIcfgContainer [2020-02-10 19:29:21,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:29:21,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:29:21,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:29:21,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:29:21,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:29:20" (1/2) ... [2020-02-10 19:29:21,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d67534 and model type example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:29:21, skipping insertion in model container [2020-02-10 19:29:21,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:29:21" (2/2) ... [2020-02-10 19:29:21,503 INFO L109 eAbstractionObserver]: Analyzing ICFG example_10.bpl [2020-02-10 19:29:21,520 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:29:21,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:29:21,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:29:21,528 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:29:21,755 INFO L251 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-02-10 19:29:21,773 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:29:21,773 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:29:21,773 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:29:21,773 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:29:21,774 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:29:21,774 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:29:21,774 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:29:21,774 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:29:21,790 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 143 transitions [2020-02-10 19:29:21,792 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-02-10 19:29:24,876 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-02-10 19:29:24,876 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-02-10 19:29:24,957 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5153 events. 4097/5153 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20915 event pairs. 0/5152 useless extension candidates. Maximal degree in co-relation 4655. Up to 1260 conditions per place. [2020-02-10 19:29:25,081 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-02-10 19:29:28,554 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-02-10 19:29:28,554 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-02-10 19:29:28,606 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5153 events. 4097/5153 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20915 event pairs. 0/5152 useless extension candidates. Maximal degree in co-relation 4655. Up to 1260 conditions per place. [2020-02-10 19:29:28,710 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3780 [2020-02-10 19:29:28,712 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:29:28,996 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1035 [2020-02-10 19:29:28,996 INFO L214 etLargeBlockEncoding]: Total number of compositions: 11 [2020-02-10 19:29:29,009 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 132 transitions [2020-02-10 19:29:42,093 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60074 states. [2020-02-10 19:29:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 60074 states. [2020-02-10 19:29:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:29:43,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:29:43,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:29:43,778 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:29:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:29:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 661896340, now seen corresponding path program 1 times [2020-02-10 19:29:43,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:29:43,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729983033] [2020-02-10 19:29:43,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:29:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:29:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:29:43,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729983033] [2020-02-10 19:29:43,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:29:43,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:29:43,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756013054] [2020-02-10 19:29:43,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:29:43,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:29:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:29:43,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:29:43,996 INFO L87 Difference]: Start difference. First operand 60074 states. Second operand 3 states. [2020-02-10 19:29:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:29:44,876 INFO L93 Difference]: Finished difference Result 59562 states and 393662 transitions. [2020-02-10 19:29:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:29:44,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:29:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:29:45,398 INFO L225 Difference]: With dead ends: 59562 [2020-02-10 19:29:45,399 INFO L226 Difference]: Without dead ends: 59561 [2020-02-10 19:29:45,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:29:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59561 states. [2020-02-10 19:29:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59561 to 59561. [2020-02-10 19:29:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59561 states. [2020-02-10 19:29:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59561 states to 59561 states and 393661 transitions. [2020-02-10 19:29:53,039 INFO L78 Accepts]: Start accepts. Automaton has 59561 states and 393661 transitions. Word has length 31 [2020-02-10 19:29:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:29:53,040 INFO L479 AbstractCegarLoop]: Abstraction has 59561 states and 393661 transitions. [2020-02-10 19:29:53,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:29:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 59561 states and 393661 transitions. [2020-02-10 19:29:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:29:53,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:29:53,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:29:53,267 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:29:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:29:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash 426637814, now seen corresponding path program 1 times [2020-02-10 19:29:53,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:29:53,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375829590] [2020-02-10 19:29:53,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:29:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:29:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:29:53,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375829590] [2020-02-10 19:29:53,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:29:53,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:29:53,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271501404] [2020-02-10 19:29:53,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:29:53,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:29:53,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:29:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:29:53,315 INFO L87 Difference]: Start difference. First operand 59561 states and 393661 transitions. Second operand 3 states. [2020-02-10 19:29:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:29:53,845 INFO L93 Difference]: Finished difference Result 46761 states and 293565 transitions. [2020-02-10 19:29:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:29:53,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:29:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:29:54,054 INFO L225 Difference]: With dead ends: 46761 [2020-02-10 19:29:54,055 INFO L226 Difference]: Without dead ends: 46761 [2020-02-10 19:29:54,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:29:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46761 states. [2020-02-10 19:30:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46761 to 46761. [2020-02-10 19:30:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46761 states. [2020-02-10 19:30:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46761 states to 46761 states and 293565 transitions. [2020-02-10 19:30:01,159 INFO L78 Accepts]: Start accepts. Automaton has 46761 states and 293565 transitions. Word has length 31 [2020-02-10 19:30:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:01,160 INFO L479 AbstractCegarLoop]: Abstraction has 46761 states and 293565 transitions. [2020-02-10 19:30:01,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 46761 states and 293565 transitions. [2020-02-10 19:30:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:01,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:01,261 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1161690204, now seen corresponding path program 1 times [2020-02-10 19:30:01,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:01,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841386973] [2020-02-10 19:30:01,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:01,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841386973] [2020-02-10 19:30:01,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:01,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:30:01,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159861968] [2020-02-10 19:30:01,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:30:01,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:30:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:01,316 INFO L87 Difference]: Start difference. First operand 46761 states and 293565 transitions. Second operand 3 states. [2020-02-10 19:30:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:01,642 INFO L93 Difference]: Finished difference Result 44201 states and 271549 transitions. [2020-02-10 19:30:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:30:01,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:30:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:01,895 INFO L225 Difference]: With dead ends: 44201 [2020-02-10 19:30:01,895 INFO L226 Difference]: Without dead ends: 44201 [2020-02-10 19:30:01,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44201 states. [2020-02-10 19:30:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44201 to 44201. [2020-02-10 19:30:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44201 states. [2020-02-10 19:30:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44201 states to 44201 states and 271549 transitions. [2020-02-10 19:30:07,959 INFO L78 Accepts]: Start accepts. Automaton has 44201 states and 271549 transitions. Word has length 31 [2020-02-10 19:30:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:07,959 INFO L479 AbstractCegarLoop]: Abstraction has 44201 states and 271549 transitions. [2020-02-10 19:30:07,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 44201 states and 271549 transitions. [2020-02-10 19:30:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:08,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:08,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:08,081 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:08,081 INFO L82 PathProgramCache]: Analyzing trace with hash 852645084, now seen corresponding path program 1 times [2020-02-10 19:30:08,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:08,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689256629] [2020-02-10 19:30:08,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:08,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689256629] [2020-02-10 19:30:08,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:08,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:30:08,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709636684] [2020-02-10 19:30:08,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:30:08,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:30:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:08,115 INFO L87 Difference]: Start difference. First operand 44201 states and 271549 transitions. Second operand 3 states. [2020-02-10 19:30:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:08,369 INFO L93 Difference]: Finished difference Result 38313 states and 225981 transitions. [2020-02-10 19:30:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:30:08,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:30:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:08,522 INFO L225 Difference]: With dead ends: 38313 [2020-02-10 19:30:08,522 INFO L226 Difference]: Without dead ends: 38313 [2020-02-10 19:30:08,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38313 states. [2020-02-10 19:30:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38313 to 38313. [2020-02-10 19:30:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38313 states. [2020-02-10 19:30:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38313 states to 38313 states and 225981 transitions. [2020-02-10 19:30:11,157 INFO L78 Accepts]: Start accepts. Automaton has 38313 states and 225981 transitions. Word has length 31 [2020-02-10 19:30:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:11,157 INFO L479 AbstractCegarLoop]: Abstraction has 38313 states and 225981 transitions. [2020-02-10 19:30:11,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 38313 states and 225981 transitions. [2020-02-10 19:30:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:11,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:11,235 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:11,236 INFO L82 PathProgramCache]: Analyzing trace with hash 567479930, now seen corresponding path program 1 times [2020-02-10 19:30:11,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:11,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807234243] [2020-02-10 19:30:11,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:11,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807234243] [2020-02-10 19:30:11,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:11,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:30:11,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577087836] [2020-02-10 19:30:11,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:30:11,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:30:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:11,269 INFO L87 Difference]: Start difference. First operand 38313 states and 225981 transitions. Second operand 3 states. [2020-02-10 19:30:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:11,447 INFO L93 Difference]: Finished difference Result 25961 states and 144061 transitions. [2020-02-10 19:30:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:30:11,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:30:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:11,521 INFO L225 Difference]: With dead ends: 25961 [2020-02-10 19:30:11,521 INFO L226 Difference]: Without dead ends: 25961 [2020-02-10 19:30:11,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2020-02-10 19:30:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 25961. [2020-02-10 19:30:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25961 states. [2020-02-10 19:30:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25961 states to 25961 states and 144061 transitions. [2020-02-10 19:30:13,514 INFO L78 Accepts]: Start accepts. Automaton has 25961 states and 144061 transitions. Word has length 31 [2020-02-10 19:30:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:13,515 INFO L479 AbstractCegarLoop]: Abstraction has 25961 states and 144061 transitions. [2020-02-10 19:30:13,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 25961 states and 144061 transitions. [2020-02-10 19:30:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:13,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:13,568 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1677176002, now seen corresponding path program 1 times [2020-02-10 19:30:13,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:13,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058052942] [2020-02-10 19:30:13,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:13,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058052942] [2020-02-10 19:30:13,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:13,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:30:13,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696471387] [2020-02-10 19:30:13,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:30:13,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:30:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:13,599 INFO L87 Difference]: Start difference. First operand 25961 states and 144061 transitions. Second operand 3 states. [2020-02-10 19:30:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:13,739 INFO L93 Difference]: Finished difference Result 15753 states and 82941 transitions. [2020-02-10 19:30:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:30:13,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:30:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:13,798 INFO L225 Difference]: With dead ends: 15753 [2020-02-10 19:30:13,799 INFO L226 Difference]: Without dead ends: 15753 [2020-02-10 19:30:13,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15753 states. [2020-02-10 19:30:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15753 to 15753. [2020-02-10 19:30:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15753 states. [2020-02-10 19:30:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15753 states to 15753 states and 82941 transitions. [2020-02-10 19:30:14,461 INFO L78 Accepts]: Start accepts. Automaton has 15753 states and 82941 transitions. Word has length 31 [2020-02-10 19:30:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:14,461 INFO L479 AbstractCegarLoop]: Abstraction has 15753 states and 82941 transitions. [2020-02-10 19:30:14,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15753 states and 82941 transitions. [2020-02-10 19:30:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:14,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:14,489 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:14,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579948, now seen corresponding path program 1 times [2020-02-10 19:30:14,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:14,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068228821] [2020-02-10 19:30:14,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:14,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068228821] [2020-02-10 19:30:14,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:14,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:30:14,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545560166] [2020-02-10 19:30:14,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:30:14,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:30:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:14,527 INFO L87 Difference]: Start difference. First operand 15753 states and 82941 transitions. Second operand 3 states. [2020-02-10 19:30:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:14,595 INFO L93 Difference]: Finished difference Result 8825 states and 45229 transitions. [2020-02-10 19:30:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:30:14,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:30:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:14,620 INFO L225 Difference]: With dead ends: 8825 [2020-02-10 19:30:14,620 INFO L226 Difference]: Without dead ends: 8825 [2020-02-10 19:30:14,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2020-02-10 19:30:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8825. [2020-02-10 19:30:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8825 states. [2020-02-10 19:30:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8825 states to 8825 states and 45229 transitions. [2020-02-10 19:30:14,997 INFO L78 Accepts]: Start accepts. Automaton has 8825 states and 45229 transitions. Word has length 31 [2020-02-10 19:30:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:14,998 INFO L479 AbstractCegarLoop]: Abstraction has 8825 states and 45229 transitions. [2020-02-10 19:30:14,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 8825 states and 45229 transitions. [2020-02-10 19:30:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:15,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:15,013 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 982570830, now seen corresponding path program 1 times [2020-02-10 19:30:15,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:15,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651769734] [2020-02-10 19:30:15,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:15,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651769734] [2020-02-10 19:30:15,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:15,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:30:15,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294967168] [2020-02-10 19:30:15,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:30:15,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:30:15,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:15,040 INFO L87 Difference]: Start difference. First operand 8825 states and 45229 transitions. Second operand 3 states. [2020-02-10 19:30:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:16,108 INFO L93 Difference]: Finished difference Result 5097 states and 25581 transitions. [2020-02-10 19:30:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:30:16,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:30:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:16,122 INFO L225 Difference]: With dead ends: 5097 [2020-02-10 19:30:16,123 INFO L226 Difference]: Without dead ends: 5097 [2020-02-10 19:30:16,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2020-02-10 19:30:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5097. [2020-02-10 19:30:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5097 states. [2020-02-10 19:30:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 25581 transitions. [2020-02-10 19:30:16,373 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 25581 transitions. Word has length 31 [2020-02-10 19:30:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:16,373 INFO L479 AbstractCegarLoop]: Abstraction has 5097 states and 25581 transitions. [2020-02-10 19:30:16,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 25581 transitions. [2020-02-10 19:30:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:16,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:16,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:16,383 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1054359614, now seen corresponding path program 1 times [2020-02-10 19:30:16,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:16,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415879988] [2020-02-10 19:30:16,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30: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 19:30:16,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415879988] [2020-02-10 19:30:16,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:16,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:30:16,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097885015] [2020-02-10 19:30:16,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:30:16,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:16,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:30:16,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:16,420 INFO L87 Difference]: Start difference. First operand 5097 states and 25581 transitions. Second operand 3 states. [2020-02-10 19:30:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:16,461 INFO L93 Difference]: Finished difference Result 3071 states and 15361 transitions. [2020-02-10 19:30:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:30:16,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:30:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:16,473 INFO L225 Difference]: With dead ends: 3071 [2020-02-10 19:30:16,473 INFO L226 Difference]: Without dead ends: 3071 [2020-02-10 19:30:16,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:30:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2020-02-10 19:30:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2020-02-10 19:30:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2020-02-10 19:30:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 15361 transitions. [2020-02-10 19:30:16,683 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 15361 transitions. Word has length 31 [2020-02-10 19:30:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:16,683 INFO L479 AbstractCegarLoop]: Abstraction has 3071 states and 15361 transitions. [2020-02-10 19:30:16,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:30:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 15361 transitions. [2020-02-10 19:30:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:16,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:16,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:16,691 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash -605876662, now seen corresponding path program 1 times [2020-02-10 19:30:16,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:16,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438653652] [2020-02-10 19:30:16,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:17,694 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:30:17,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 19:30:17,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438653652] [2020-02-10 19:30:17,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:17,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:17,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589227518] [2020-02-10 19:30:17,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:17,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:17,712 INFO L87 Difference]: Start difference. First operand 3071 states and 15361 transitions. Second operand 12 states. [2020-02-10 19:30:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:18,039 INFO L93 Difference]: Finished difference Result 6095 states and 27102 transitions. [2020-02-10 19:30:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:18,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:18,054 INFO L225 Difference]: With dead ends: 6095 [2020-02-10 19:30:18,055 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 19:30:18,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 19:30:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3141. [2020-02-10 19:30:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:30:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15673 transitions. [2020-02-10 19:30:18,297 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15673 transitions. Word has length 31 [2020-02-10 19:30:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:18,297 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15673 transitions. [2020-02-10 19:30:18,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15673 transitions. [2020-02-10 19:30:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:18,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:18,304 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1873333840, now seen corresponding path program 2 times [2020-02-10 19:30:18,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:18,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873179303] [2020-02-10 19:30:18,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:18,863 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:30:19,002 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:19,140 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:30:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:19,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873179303] [2020-02-10 19:30:19,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:19,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:19,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206901822] [2020-02-10 19:30:19,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:19,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:19,160 INFO L87 Difference]: Start difference. First operand 3141 states and 15673 transitions. Second operand 12 states. [2020-02-10 19:30:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:19,543 INFO L93 Difference]: Finished difference Result 6096 states and 27096 transitions. [2020-02-10 19:30:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:19,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:19,562 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 19:30:19,562 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 19:30:19,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 19:30:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3133. [2020-02-10 19:30:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:30:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15651 transitions. [2020-02-10 19:30:19,844 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15651 transitions. Word has length 31 [2020-02-10 19:30:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:19,844 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15651 transitions. [2020-02-10 19:30:19,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15651 transitions. [2020-02-10 19:30:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:19,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:19,852 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1454499134, now seen corresponding path program 3 times [2020-02-10 19:30:19,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:19,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612982692] [2020-02-10 19:30:19,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:20,373 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:30:20,535 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:20,671 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:30:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:20,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612982692] [2020-02-10 19:30:20,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:20,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:20,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613051832] [2020-02-10 19:30:20,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:20,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:20,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:20,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:20,686 INFO L87 Difference]: Start difference. First operand 3133 states and 15651 transitions. Second operand 12 states. [2020-02-10 19:30:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:20,977 INFO L93 Difference]: Finished difference Result 6092 states and 27088 transitions. [2020-02-10 19:30:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:20,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:20,993 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 19:30:20,993 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 19:30:20,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 19:30:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3140. [2020-02-10 19:30:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:30:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15664 transitions. [2020-02-10 19:30:21,296 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15664 transitions. Word has length 31 [2020-02-10 19:30:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:21,296 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15664 transitions. [2020-02-10 19:30:21,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15664 transitions. [2020-02-10 19:30:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:21,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:21,304 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash -116931920, now seen corresponding path program 4 times [2020-02-10 19:30:21,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:21,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912528340] [2020-02-10 19:30:21,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:21,950 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:22,099 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:30:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:22,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912528340] [2020-02-10 19:30:22,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:22,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:22,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353370891] [2020-02-10 19:30:22,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:22,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:22,113 INFO L87 Difference]: Start difference. First operand 3140 states and 15664 transitions. Second operand 12 states. [2020-02-10 19:30:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:22,392 INFO L93 Difference]: Finished difference Result 6091 states and 27079 transitions. [2020-02-10 19:30:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:22,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:22,411 INFO L225 Difference]: With dead ends: 6091 [2020-02-10 19:30:22,411 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 19:30:22,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 19:30:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3133. [2020-02-10 19:30:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:30:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15644 transitions. [2020-02-10 19:30:22,665 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15644 transitions. Word has length 31 [2020-02-10 19:30:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:22,665 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15644 transitions. [2020-02-10 19:30:22,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15644 transitions. [2020-02-10 19:30:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:22,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:22,670 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash 936544130, now seen corresponding path program 5 times [2020-02-10 19:30:22,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:22,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142026062] [2020-02-10 19:30:22,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:23,278 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:30:23,423 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:23,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142026062] [2020-02-10 19:30:23,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:23,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:23,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244906342] [2020-02-10 19:30:23,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:23,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:23,436 INFO L87 Difference]: Start difference. First operand 3133 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:30:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:23,720 INFO L93 Difference]: Finished difference Result 6094 states and 27085 transitions. [2020-02-10 19:30:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:23,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:23,736 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 19:30:23,736 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 19:30:23,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 19:30:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3140. [2020-02-10 19:30:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:30:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15657 transitions. [2020-02-10 19:30:23,949 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15657 transitions. Word has length 31 [2020-02-10 19:30:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:23,949 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15657 transitions. [2020-02-10 19:30:23,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15657 transitions. [2020-02-10 19:30:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:23,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:23,955 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash -753398774, now seen corresponding path program 6 times [2020-02-10 19:30:23,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:23,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490206637] [2020-02-10 19:30:23,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:24,716 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:24,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490206637] [2020-02-10 19:30:24,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:24,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:24,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985496676] [2020-02-10 19:30:24,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:24,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:24,726 INFO L87 Difference]: Start difference. First operand 3140 states and 15657 transitions. Second operand 12 states. [2020-02-10 19:30:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:25,068 INFO L93 Difference]: Finished difference Result 6092 states and 27074 transitions. [2020-02-10 19:30:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:25,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:25,086 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 19:30:25,087 INFO L226 Difference]: Without dead ends: 6060 [2020-02-10 19:30:25,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-02-10 19:30:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3126. [2020-02-10 19:30:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:30:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15624 transitions. [2020-02-10 19:30:25,311 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15624 transitions. Word has length 31 [2020-02-10 19:30:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:25,311 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15624 transitions. [2020-02-10 19:30:25,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15624 transitions. [2020-02-10 19:30:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:25,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:25,317 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1138487344, now seen corresponding path program 7 times [2020-02-10 19:30:25,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:25,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798730587] [2020-02-10 19:30:25,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:26,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798730587] [2020-02-10 19:30:26,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:26,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:26,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459601221] [2020-02-10 19:30:26,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:26,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:26,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:26,063 INFO L87 Difference]: Start difference. First operand 3126 states and 15624 transitions. Second operand 12 states. [2020-02-10 19:30:26,354 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2020-02-10 19:30:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:26,375 INFO L93 Difference]: Finished difference Result 6109 states and 27126 transitions. [2020-02-10 19:30:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:26,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:26,391 INFO L225 Difference]: With dead ends: 6109 [2020-02-10 19:30:26,391 INFO L226 Difference]: Without dead ends: 6090 [2020-02-10 19:30:26,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2020-02-10 19:30:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 3145. [2020-02-10 19:30:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2020-02-10 19:30:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 15676 transitions. [2020-02-10 19:30:26,609 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 15676 transitions. Word has length 31 [2020-02-10 19:30:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:26,609 INFO L479 AbstractCegarLoop]: Abstraction has 3145 states and 15676 transitions. [2020-02-10 19:30:26,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 15676 transitions. [2020-02-10 19:30:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:26,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:26,615 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -128969834, now seen corresponding path program 8 times [2020-02-10 19:30:26,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:26,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092575461] [2020-02-10 19:30:26,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:27,256 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:27,399 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:30:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:27,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092575461] [2020-02-10 19:30:27,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:27,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:27,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308253474] [2020-02-10 19:30:27,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:27,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:27,419 INFO L87 Difference]: Start difference. First operand 3145 states and 15676 transitions. Second operand 12 states. [2020-02-10 19:30:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:27,677 INFO L93 Difference]: Finished difference Result 6110 states and 27120 transitions. [2020-02-10 19:30:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:27,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:27,694 INFO L225 Difference]: With dead ends: 6110 [2020-02-10 19:30:27,694 INFO L226 Difference]: Without dead ends: 6082 [2020-02-10 19:30:27,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-02-10 19:30:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3137. [2020-02-10 19:30:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:30:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15653 transitions. [2020-02-10 19:30:27,906 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15653 transitions. Word has length 31 [2020-02-10 19:30:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:27,906 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15653 transitions. [2020-02-10 19:30:27,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15653 transitions. [2020-02-10 19:30:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:27,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:27,912 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -346601982, now seen corresponding path program 9 times [2020-02-10 19:30:27,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:27,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766519000] [2020-02-10 19:30:27,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:28,417 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2020-02-10 19:30:28,773 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:28,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 19:30:28,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766519000] [2020-02-10 19:30:28,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:28,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:28,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500519939] [2020-02-10 19:30:28,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:28,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:28,784 INFO L87 Difference]: Start difference. First operand 3137 states and 15653 transitions. Second operand 12 states. [2020-02-10 19:30:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:29,074 INFO L93 Difference]: Finished difference Result 6112 states and 27123 transitions. [2020-02-10 19:30:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:29,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:29,089 INFO L225 Difference]: With dead ends: 6112 [2020-02-10 19:30:29,089 INFO L226 Difference]: Without dead ends: 6093 [2020-02-10 19:30:29,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2020-02-10 19:30:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 3146. [2020-02-10 19:30:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 19:30:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15670 transitions. [2020-02-10 19:30:29,298 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15670 transitions. Word has length 31 [2020-02-10 19:30:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:29,298 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15670 transitions. [2020-02-10 19:30:29,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15670 transitions. [2020-02-10 19:30:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:29,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:29,304 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash -276491946, now seen corresponding path program 10 times [2020-02-10 19:30:29,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:29,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873689432] [2020-02-10 19:30:29,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:30,054 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:30,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873689432] [2020-02-10 19:30:30,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:30,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:30,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627481479] [2020-02-10 19:30:30,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:30,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:30,065 INFO L87 Difference]: Start difference. First operand 3146 states and 15670 transitions. Second operand 12 states. [2020-02-10 19:30:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:30,307 INFO L93 Difference]: Finished difference Result 6115 states and 27120 transitions. [2020-02-10 19:30:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:30,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:30,322 INFO L225 Difference]: With dead ends: 6115 [2020-02-10 19:30:30,322 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 19:30:30,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 19:30:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3137. [2020-02-10 19:30:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:30:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15644 transitions. [2020-02-10 19:30:30,544 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15644 transitions. Word has length 31 [2020-02-10 19:30:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:30,544 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15644 transitions. [2020-02-10 19:30:30,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15644 transitions. [2020-02-10 19:30:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:30,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:30,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:30,550 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:30,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2044441282, now seen corresponding path program 11 times [2020-02-10 19:30:30,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:30,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182299746] [2020-02-10 19:30:30,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:31,177 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:31,310 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:30: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 19:30:31,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182299746] [2020-02-10 19:30:31,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:31,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:31,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491341578] [2020-02-10 19:30:31,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:31,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:31,322 INFO L87 Difference]: Start difference. First operand 3137 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:30:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:31,592 INFO L93 Difference]: Finished difference Result 6116 states and 27122 transitions. [2020-02-10 19:30:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:31,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:31,607 INFO L225 Difference]: With dead ends: 6116 [2020-02-10 19:30:31,607 INFO L226 Difference]: Without dead ends: 6096 [2020-02-10 19:30:31,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2020-02-10 19:30:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 3148. [2020-02-10 19:30:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2020-02-10 19:30:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 15664 transitions. [2020-02-10 19:30:31,871 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 15664 transitions. Word has length 31 [2020-02-10 19:30:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:31,872 INFO L479 AbstractCegarLoop]: Abstraction has 3148 states and 15664 transitions. [2020-02-10 19:30:31,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 15664 transitions. [2020-02-10 19:30:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:31,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:31,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:31,877 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash -912958800, now seen corresponding path program 12 times [2020-02-10 19:30:31,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:31,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820862228] [2020-02-10 19:30:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:32,481 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:30:32,617 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-02-10 19:30:32,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 19:30:32,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820862228] [2020-02-10 19:30:32,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:32,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:32,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823280706] [2020-02-10 19:30:32,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:32,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:32,629 INFO L87 Difference]: Start difference. First operand 3148 states and 15664 transitions. Second operand 12 states. [2020-02-10 19:30:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:32,991 INFO L93 Difference]: Finished difference Result 6118 states and 27116 transitions. [2020-02-10 19:30:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:32,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:33,007 INFO L225 Difference]: With dead ends: 6118 [2020-02-10 19:30:33,007 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 19:30:33,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 19:30:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3126. [2020-02-10 19:30:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:30:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15614 transitions. [2020-02-10 19:30:33,219 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15614 transitions. Word has length 31 [2020-02-10 19:30:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:33,219 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15614 transitions. [2020-02-10 19:30:33,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15614 transitions. [2020-02-10 19:30:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:33,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:33,226 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash -247627984, now seen corresponding path program 13 times [2020-02-10 19:30:33,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:33,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691540765] [2020-02-10 19:30:33,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:33,851 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:30:33,976 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:33,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 19:30:33,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691540765] [2020-02-10 19:30:33,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:33,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:33,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857983913] [2020-02-10 19:30:33,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:33,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:33,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:33,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:33,989 INFO L87 Difference]: Start difference. First operand 3126 states and 15614 transitions. Second operand 12 states. [2020-02-10 19:30:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:34,359 INFO L93 Difference]: Finished difference Result 6097 states and 27088 transitions. [2020-02-10 19:30:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:34,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:34,375 INFO L225 Difference]: With dead ends: 6097 [2020-02-10 19:30:34,375 INFO L226 Difference]: Without dead ends: 6078 [2020-02-10 19:30:34,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-02-10 19:30:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3141. [2020-02-10 19:30:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:30:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15657 transitions. [2020-02-10 19:30:34,585 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15657 transitions. Word has length 31 [2020-02-10 19:30:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:34,585 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15657 transitions. [2020-02-10 19:30:34,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15657 transitions. [2020-02-10 19:30:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:34,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:34,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:34,591 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1089939230, now seen corresponding path program 14 times [2020-02-10 19:30:34,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:34,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189497215] [2020-02-10 19:30:34,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:35,176 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:30:35,311 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:35,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189497215] [2020-02-10 19:30:35,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:35,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:35,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462063575] [2020-02-10 19:30:35,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:35,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:35,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:35,323 INFO L87 Difference]: Start difference. First operand 3141 states and 15657 transitions. Second operand 12 states. [2020-02-10 19:30:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:35,667 INFO L93 Difference]: Finished difference Result 6096 states and 27079 transitions. [2020-02-10 19:30:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:35,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:35,682 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 19:30:35,683 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 19:30:35,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 19:30:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3134. [2020-02-10 19:30:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:30:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15637 transitions. [2020-02-10 19:30:35,892 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15637 transitions. Word has length 31 [2020-02-10 19:30:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:35,893 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15637 transitions. [2020-02-10 19:30:35,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15637 transitions. [2020-02-10 19:30:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:35,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:35,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:35,898 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -884094838, now seen corresponding path program 15 times [2020-02-10 19:30:35,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:35,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842099512] [2020-02-10 19:30:35,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:36,459 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:30:36,589 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:36,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842099512] [2020-02-10 19:30:36,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:36,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:36,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203845300] [2020-02-10 19:30:36,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:36,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:36,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:36,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:36,601 INFO L87 Difference]: Start difference. First operand 3134 states and 15637 transitions. Second operand 12 states. [2020-02-10 19:30:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:36,898 INFO L93 Difference]: Finished difference Result 6103 states and 27093 transitions. [2020-02-10 19:30:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:36,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:36,914 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 19:30:36,914 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 19:30:36,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 19:30:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3143. [2020-02-10 19:30:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:30:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15654 transitions. [2020-02-10 19:30:37,133 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15654 transitions. Word has length 31 [2020-02-10 19:30:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:37,133 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15654 transitions. [2020-02-10 19:30:37,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15654 transitions. [2020-02-10 19:30:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:37,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:37,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:37,139 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash -813984802, now seen corresponding path program 16 times [2020-02-10 19:30:37,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:37,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830621762] [2020-02-10 19:30:37,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:37,691 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 19:30:37,850 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:30:38,049 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 19:30:38,245 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:38,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830621762] [2020-02-10 19:30:38,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:38,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:38,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357004696] [2020-02-10 19:30:38,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:38,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:38,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:38,268 INFO L87 Difference]: Start difference. First operand 3143 states and 15654 transitions. Second operand 12 states. [2020-02-10 19:30:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:38,486 INFO L93 Difference]: Finished difference Result 6106 states and 27090 transitions. [2020-02-10 19:30:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:38,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:38,502 INFO L225 Difference]: With dead ends: 6106 [2020-02-10 19:30:38,502 INFO L226 Difference]: Without dead ends: 6075 [2020-02-10 19:30:38,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-02-10 19:30:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3134. [2020-02-10 19:30:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:30:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-02-10 19:30:38,720 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-02-10 19:30:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:38,720 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-02-10 19:30:38,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-02-10 19:30:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:38,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:38,725 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1031616950, now seen corresponding path program 17 times [2020-02-10 19:30:38,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:38,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140323146] [2020-02-10 19:30:38,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:39,315 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:30:39,465 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:39,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 19:30:39,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140323146] [2020-02-10 19:30:39,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:39,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:39,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647186229] [2020-02-10 19:30:39,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:39,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:39,477 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-02-10 19:30:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:39,703 INFO L93 Difference]: Finished difference Result 6100 states and 27078 transitions. [2020-02-10 19:30:39,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:39,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:39,719 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 19:30:39,719 INFO L226 Difference]: Without dead ends: 6082 [2020-02-10 19:30:39,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-02-10 19:30:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3142. [2020-02-10 19:30:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 19:30:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15644 transitions. [2020-02-10 19:30:39,929 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15644 transitions. Word has length 31 [2020-02-10 19:30:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:39,929 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15644 transitions. [2020-02-10 19:30:39,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15644 transitions. [2020-02-10 19:30:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:39,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:39,934 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:39,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1995893168, now seen corresponding path program 18 times [2020-02-10 19:30:39,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:39,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003367925] [2020-02-10 19:30:39,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:40,531 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:30:40,663 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:40,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003367925] [2020-02-10 19:30:40,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:40,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:40,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716654784] [2020-02-10 19:30:40,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:40,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:40,674 INFO L87 Difference]: Start difference. First operand 3142 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:30:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:40,874 INFO L93 Difference]: Finished difference Result 6104 states and 27078 transitions. [2020-02-10 19:30:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:40,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:40,890 INFO L225 Difference]: With dead ends: 6104 [2020-02-10 19:30:40,890 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 19:30:40,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 19:30:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3126. [2020-02-10 19:30:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:30:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15606 transitions. [2020-02-10 19:30:41,105 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15606 transitions. Word has length 31 [2020-02-10 19:30:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:41,106 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15606 transitions. [2020-02-10 19:30:41,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15606 transitions. [2020-02-10 19:30:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:41,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:41,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:41,113 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash -407188010, now seen corresponding path program 19 times [2020-02-10 19:30:41,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:41,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287598332] [2020-02-10 19:30:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:41,707 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:30:41,843 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:41,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287598332] [2020-02-10 19:30:41,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:41,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:41,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243988686] [2020-02-10 19:30:41,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:41,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:41,853 INFO L87 Difference]: Start difference. First operand 3126 states and 15606 transitions. Second operand 12 states. [2020-02-10 19:30:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:42,086 INFO L93 Difference]: Finished difference Result 6103 states and 27092 transitions. [2020-02-10 19:30:42,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:42,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:42,100 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 19:30:42,100 INFO L226 Difference]: Without dead ends: 6083 [2020-02-10 19:30:42,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2020-02-10 19:30:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 3142. [2020-02-10 19:30:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 19:30:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15651 transitions. [2020-02-10 19:30:42,312 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15651 transitions. Word has length 31 [2020-02-10 19:30:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:42,312 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15651 transitions. [2020-02-10 19:30:42,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15651 transitions. [2020-02-10 19:30:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:42,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:42,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:42,320 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2097130914, now seen corresponding path program 20 times [2020-02-10 19:30:42,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:42,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102915134] [2020-02-10 19:30:42,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:42,934 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:30:43,065 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:43,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102915134] [2020-02-10 19:30:43,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:43,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:43,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8058590] [2020-02-10 19:30:43,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:43,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:43,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:43,077 INFO L87 Difference]: Start difference. First operand 3142 states and 15651 transitions. Second operand 12 states. [2020-02-10 19:30:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:43,309 INFO L93 Difference]: Finished difference Result 6101 states and 27081 transitions. [2020-02-10 19:30:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:43,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:43,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:43,324 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 19:30:43,324 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 19:30:43,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 19:30:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3135. [2020-02-10 19:30:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:30:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15631 transitions. [2020-02-10 19:30:43,590 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15631 transitions. Word has length 31 [2020-02-10 19:30:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:43,590 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15631 transitions. [2020-02-10 19:30:43,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15631 transitions. [2020-02-10 19:30:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:43,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:43,596 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:43,596 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1043654864, now seen corresponding path program 21 times [2020-02-10 19:30:43,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:43,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159332960] [2020-02-10 19:30:43,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:44,188 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:30:44,320 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:44,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159332960] [2020-02-10 19:30:44,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:44,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:44,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424946079] [2020-02-10 19:30:44,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:44,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:44,331 INFO L87 Difference]: Start difference. First operand 3135 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:30:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:44,569 INFO L93 Difference]: Finished difference Result 6111 states and 27101 transitions. [2020-02-10 19:30:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:44,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:44,587 INFO L225 Difference]: With dead ends: 6111 [2020-02-10 19:30:44,588 INFO L226 Difference]: Without dead ends: 6091 [2020-02-10 19:30:44,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2020-02-10 19:30:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3146. [2020-02-10 19:30:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 19:30:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15651 transitions. [2020-02-10 19:30:44,816 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15651 transitions. Word has length 31 [2020-02-10 19:30:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:44,816 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15651 transitions. [2020-02-10 19:30:44,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15651 transitions. [2020-02-10 19:30:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:44,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:44,822 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 293912350, now seen corresponding path program 22 times [2020-02-10 19:30:44,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:44,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135982609] [2020-02-10 19:30:44,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:45,433 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:30:45,565 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:30:45,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 19:30:45,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135982609] [2020-02-10 19:30:45,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:45,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:45,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440267335] [2020-02-10 19:30:45,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:45,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:45,578 INFO L87 Difference]: Start difference. First operand 3146 states and 15651 transitions. Second operand 12 states. [2020-02-10 19:30:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:45,770 INFO L93 Difference]: Finished difference Result 6113 states and 27095 transitions. [2020-02-10 19:30:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:45,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:45,786 INFO L225 Difference]: With dead ends: 6113 [2020-02-10 19:30:45,786 INFO L226 Difference]: Without dead ends: 6080 [2020-02-10 19:30:45,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2020-02-10 19:30:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 3135. [2020-02-10 19:30:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:30:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15622 transitions. [2020-02-10 19:30:46,000 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15622 transitions. Word has length 31 [2020-02-10 19:30:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:46,000 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15622 transitions. [2020-02-10 19:30:46,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15622 transitions. [2020-02-10 19:30:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:46,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:46,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:46,006 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:46,006 INFO L82 PathProgramCache]: Analyzing trace with hash 712747056, now seen corresponding path program 23 times [2020-02-10 19:30:46,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:46,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833473366] [2020-02-10 19:30:46,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:46,740 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:30:46,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 19:30:46,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833473366] [2020-02-10 19:30:46,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:46,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:46,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011621099] [2020-02-10 19:30:46,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:46,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:46,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:46,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:46,752 INFO L87 Difference]: Start difference. First operand 3135 states and 15622 transitions. Second operand 12 states. [2020-02-10 19:30:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:46,976 INFO L93 Difference]: Finished difference Result 6104 states and 27077 transitions. [2020-02-10 19:30:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:46,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:46,990 INFO L225 Difference]: With dead ends: 6104 [2020-02-10 19:30:46,991 INFO L226 Difference]: Without dead ends: 6086 [2020-02-10 19:30:46,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2020-02-10 19:30:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 3143. [2020-02-10 19:30:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:30:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15637 transitions. [2020-02-10 19:30:47,201 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15637 transitions. Word has length 31 [2020-02-10 19:30:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:47,201 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15637 transitions. [2020-02-10 19:30:47,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15637 transitions. [2020-02-10 19:30:47,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:47,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:47,207 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash -554710122, now seen corresponding path program 24 times [2020-02-10 19:30:47,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:47,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636177983] [2020-02-10 19:30:47,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:47,617 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 19:30:47,773 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-02-10 19:30:47,969 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:30:48,099 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:30:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:48,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636177983] [2020-02-10 19:30:48,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:48,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:48,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754316117] [2020-02-10 19:30:48,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:48,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:48,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:48,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:48,112 INFO L87 Difference]: Start difference. First operand 3143 states and 15637 transitions. Second operand 12 states. [2020-02-10 19:30:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:48,301 INFO L93 Difference]: Finished difference Result 6108 states and 27077 transitions. [2020-02-10 19:30:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:48,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:48,317 INFO L225 Difference]: With dead ends: 6108 [2020-02-10 19:30:48,317 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 19:30:48,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 19:30:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3115. [2020-02-10 19:30:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:30:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15577 transitions. [2020-02-10 19:30:48,534 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15577 transitions. Word has length 31 [2020-02-10 19:30:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:48,534 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15577 transitions. [2020-02-10 19:30:48,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15577 transitions. [2020-02-10 19:30:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:48,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:48,540 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash -365158536, now seen corresponding path program 25 times [2020-02-10 19:30:48,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:48,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634143223] [2020-02-10 19:30:48,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:49,113 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:49,310 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:49,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634143223] [2020-02-10 19:30:49,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:49,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:49,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644717541] [2020-02-10 19:30:49,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:49,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:49,321 INFO L87 Difference]: Start difference. First operand 3115 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:30:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:49,571 INFO L93 Difference]: Finished difference Result 6061 states and 27001 transitions. [2020-02-10 19:30:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:49,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:49,586 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:30:49,586 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 19:30:49,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 19:30:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3135. [2020-02-10 19:30:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:30:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15644 transitions. [2020-02-10 19:30:49,804 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15644 transitions. Word has length 31 [2020-02-10 19:30:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:49,805 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15644 transitions. [2020-02-10 19:30:49,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15644 transitions. [2020-02-10 19:30:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:49,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:49,810 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1632615714, now seen corresponding path program 26 times [2020-02-10 19:30:49,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:49,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419847530] [2020-02-10 19:30:49,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:50,374 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:30:50,508 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:50,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419847530] [2020-02-10 19:30:50,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:50,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:50,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162065524] [2020-02-10 19:30:50,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:50,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:50,519 INFO L87 Difference]: Start difference. First operand 3135 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:30:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:50,768 INFO L93 Difference]: Finished difference Result 6062 states and 26995 transitions. [2020-02-10 19:30:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:50,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:50,784 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:30:50,784 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:30:50,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:30:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3127. [2020-02-10 19:30:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:30:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15623 transitions. [2020-02-10 19:30:51,001 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15623 transitions. Word has length 31 [2020-02-10 19:30:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:51,001 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15623 transitions. [2020-02-10 19:30:51,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15623 transitions. [2020-02-10 19:30:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:51,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:51,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:51,007 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash -789469772, now seen corresponding path program 27 times [2020-02-10 19:30:51,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:51,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569841207] [2020-02-10 19:30:51,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:51,581 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:51,714 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:51,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569841207] [2020-02-10 19:30:51,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:51,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:51,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937847271] [2020-02-10 19:30:51,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:51,725 INFO L87 Difference]: Start difference. First operand 3127 states and 15623 transitions. Second operand 12 states. [2020-02-10 19:30:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:51,957 INFO L93 Difference]: Finished difference Result 6056 states and 26983 transitions. [2020-02-10 19:30:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:51,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:51,972 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:30:51,972 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 19:30:51,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 19:30:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-02-10 19:30:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:30:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15634 transitions. [2020-02-10 19:30:52,183 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15634 transitions. Word has length 31 [2020-02-10 19:30:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:52,183 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15634 transitions. [2020-02-10 19:30:52,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15634 transitions. [2020-02-10 19:30:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:52,188 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:52,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:52,189 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1393068894, now seen corresponding path program 28 times [2020-02-10 19:30:52,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:52,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886065566] [2020-02-10 19:30:52,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:52,762 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:52,896 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:30:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:52,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886065566] [2020-02-10 19:30:52,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:52,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:52,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126523106] [2020-02-10 19:30:52,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:52,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:52,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:52,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:52,910 INFO L87 Difference]: Start difference. First operand 3133 states and 15634 transitions. Second operand 12 states. [2020-02-10 19:30:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:53,175 INFO L93 Difference]: Finished difference Result 6054 states and 26973 transitions. [2020-02-10 19:30:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:53,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:53,190 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:30:53,190 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 19:30:53,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 19:30:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-02-10 19:30:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:30:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15617 transitions. [2020-02-10 19:30:53,406 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15617 transitions. Word has length 31 [2020-02-10 19:30:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:53,406 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15617 transitions. [2020-02-10 19:30:53,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15617 transitions. [2020-02-10 19:30:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:53,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:53,412 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1601573492, now seen corresponding path program 29 times [2020-02-10 19:30:53,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:53,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977424281] [2020-02-10 19:30:53,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:53,990 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:30:54,124 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:54,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977424281] [2020-02-10 19:30:54,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:54,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:54,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923532452] [2020-02-10 19:30:54,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:54,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:54,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:54,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:54,135 INFO L87 Difference]: Start difference. First operand 3127 states and 15617 transitions. Second operand 12 states. [2020-02-10 19:30:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:54,420 INFO L93 Difference]: Finished difference Result 6058 states and 26981 transitions. [2020-02-10 19:30:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:54,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:54,434 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 19:30:54,435 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:30:54,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:30:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3133. [2020-02-10 19:30:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:30:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-02-10 19:30:54,659 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-02-10 19:30:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:54,659 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-02-10 19:30:54,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-02-10 19:30:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:54,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:54,665 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash 756602040, now seen corresponding path program 30 times [2020-02-10 19:30:54,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:54,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182036732] [2020-02-10 19:30:54,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:55,245 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:30:55,434 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:30:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:55,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182036732] [2020-02-10 19:30:55,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:55,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:55,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105365768] [2020-02-10 19:30:55,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:55,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:55,446 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-02-10 19:30:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:55,723 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-02-10 19:30:55,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:55,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:55,738 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 19:30:55,739 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:30:55,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:30:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-02-10 19:30:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:30:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15600 transitions. [2020-02-10 19:30:55,954 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15600 transitions. Word has length 31 [2020-02-10 19:30:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:55,954 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15600 transitions. [2020-02-10 19:30:55,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15600 transitions. [2020-02-10 19:30:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:55,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:55,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:55,959 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash -633904964, now seen corresponding path program 31 times [2020-02-10 19:30:55,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:55,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247879822] [2020-02-10 19:30:55,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:56,547 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:56,682 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:30:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:56,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247879822] [2020-02-10 19:30:56,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:56,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:56,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316024509] [2020-02-10 19:30:56,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:56,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:56,693 INFO L87 Difference]: Start difference. First operand 3121 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:30:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:56,925 INFO L93 Difference]: Finished difference Result 6065 states and 27007 transitions. [2020-02-10 19:30:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:56,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:56,940 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 19:30:56,941 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 19:30:56,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 19:30:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3136. [2020-02-10 19:30:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:30:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15642 transitions. [2020-02-10 19:30:57,157 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15642 transitions. Word has length 31 [2020-02-10 19:30:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:57,157 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15642 transitions. [2020-02-10 19:30:57,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15642 transitions. [2020-02-10 19:30:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:57,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:57,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:57,163 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:57,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1901362142, now seen corresponding path program 32 times [2020-02-10 19:30:57,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:57,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070239517] [2020-02-10 19:30:57,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:57,763 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:57,898 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:30:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:57,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070239517] [2020-02-10 19:30:57,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:57,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:57,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443309930] [2020-02-10 19:30:57,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:57,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:57,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:57,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:57,909 INFO L87 Difference]: Start difference. First operand 3136 states and 15642 transitions. Second operand 12 states. [2020-02-10 19:30:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:58,154 INFO L93 Difference]: Finished difference Result 6066 states and 27001 transitions. [2020-02-10 19:30:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:58,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:58,175 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 19:30:58,175 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:30:58,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:30:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-02-10 19:30:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:30:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15620 transitions. [2020-02-10 19:30:58,403 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15620 transitions. Word has length 31 [2020-02-10 19:30:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:58,403 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15620 transitions. [2020-02-10 19:30:58,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15620 transitions. [2020-02-10 19:30:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:58,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:58,410 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1482527436, now seen corresponding path program 33 times [2020-02-10 19:30:58,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:58,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959587125] [2020-02-10 19:30:58,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:30:58,967 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:30:59,097 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:30:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:30:59,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959587125] [2020-02-10 19:30:59,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:30:59,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:30:59,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170894557] [2020-02-10 19:30:59,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:30:59,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:30:59,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:30:59,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:30:59,107 INFO L87 Difference]: Start difference. First operand 3128 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:30:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:30:59,351 INFO L93 Difference]: Finished difference Result 6062 states and 26993 transitions. [2020-02-10 19:30:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:30:59,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:30:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:30:59,366 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:30:59,367 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 19:30:59,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:30:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 19:30:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3135. [2020-02-10 19:30:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:30:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15633 transitions. [2020-02-10 19:30:59,577 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15633 transitions. Word has length 31 [2020-02-10 19:30:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:30:59,577 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15633 transitions. [2020-02-10 19:30:59,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:30:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15633 transitions. [2020-02-10 19:30:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:30:59,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:30:59,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:30:59,583 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:30:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:30:59,583 INFO L82 PathProgramCache]: Analyzing trace with hash -144960222, now seen corresponding path program 34 times [2020-02-10 19:30:59,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:30:59,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049682381] [2020-02-10 19:30:59,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:30:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:00,144 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:00,280 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:31:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:00,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049682381] [2020-02-10 19:31:00,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:00,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:00,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625012250] [2020-02-10 19:31:00,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:00,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:00,293 INFO L87 Difference]: Start difference. First operand 3135 states and 15633 transitions. Second operand 12 states. [2020-02-10 19:31:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:00,658 INFO L93 Difference]: Finished difference Result 6061 states and 26984 transitions. [2020-02-10 19:31:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:00,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:00,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:00,673 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:31:00,674 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:31:00,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:31:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3128. [2020-02-10 19:31:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:31:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-02-10 19:31:00,892 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-02-10 19:31:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:00,893 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-02-10 19:31:00,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-02-10 19:31:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:00,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:00,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:00,899 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash 908515828, now seen corresponding path program 35 times [2020-02-10 19:31:00,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:00,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007327143] [2020-02-10 19:31:00,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:01,452 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:01,640 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:01,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007327143] [2020-02-10 19:31:01,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:01,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:01,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523358944] [2020-02-10 19:31:01,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:01,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:01,652 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-02-10 19:31:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:01,895 INFO L93 Difference]: Finished difference Result 6064 states and 26990 transitions. [2020-02-10 19:31:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:01,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:01,910 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 19:31:01,910 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 19:31:01,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 19:31:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3135. [2020-02-10 19:31:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:31:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-02-10 19:31:02,126 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-02-10 19:31:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:02,126 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-02-10 19:31:02,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-02-10 19:31:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:02,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:02,132 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash -781427076, now seen corresponding path program 36 times [2020-02-10 19:31:02,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:02,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934475742] [2020-02-10 19:31:02,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:02,807 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:02,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 19:31:02,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934475742] [2020-02-10 19:31:02,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:02,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:02,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391726741] [2020-02-10 19:31:02,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:02,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:02,818 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:31:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:03,066 INFO L93 Difference]: Finished difference Result 6062 states and 26979 transitions. [2020-02-10 19:31:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:03,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:03,082 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:31:03,082 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:31:03,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:31:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3121. [2020-02-10 19:31:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:31:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15594 transitions. [2020-02-10 19:31:03,297 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15594 transitions. Word has length 31 [2020-02-10 19:31:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:03,298 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15594 transitions. [2020-02-10 19:31:03,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15594 transitions. [2020-02-10 19:31:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:03,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:03,303 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1326962628, now seen corresponding path program 37 times [2020-02-10 19:31:03,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:03,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365560512] [2020-02-10 19:31:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:03,938 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:04,067 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:31:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:04,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365560512] [2020-02-10 19:31:04,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:04,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:04,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299471368] [2020-02-10 19:31:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:04,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:04,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:04,078 INFO L87 Difference]: Start difference. First operand 3121 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:31:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:04,327 INFO L93 Difference]: Finished difference Result 6053 states and 26970 transitions. [2020-02-10 19:31:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:04,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:04,342 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:31:04,342 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:31:04,343 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:31:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 19:31:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:31:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-02-10 19:31:04,552 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-02-10 19:31:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:04,552 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-02-10 19:31:04,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-02-10 19:31:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:04,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:04,558 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:04,558 INFO L82 PathProgramCache]: Analyzing trace with hash 855576038, now seen corresponding path program 38 times [2020-02-10 19:31:04,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:04,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697074850] [2020-02-10 19:31:04,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:05,146 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:05,281 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:31:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:05,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697074850] [2020-02-10 19:31:05,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:05,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:05,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229299885] [2020-02-10 19:31:05,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:05,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:05,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:05,293 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-02-10 19:31:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:05,554 INFO L93 Difference]: Finished difference Result 6051 states and 26960 transitions. [2020-02-10 19:31:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:05,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:05,570 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:31:05,570 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 19:31:05,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 19:31:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 19:31:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:31:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15611 transitions. [2020-02-10 19:31:05,786 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15611 transitions. Word has length 31 [2020-02-10 19:31:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:05,787 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15611 transitions. [2020-02-10 19:31:05,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15611 transitions. [2020-02-10 19:31:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:05,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:05,792 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1751273864, now seen corresponding path program 39 times [2020-02-10 19:31:05,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:05,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701610931] [2020-02-10 19:31:05,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:06,354 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:06,490 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:31:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:06,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701610931] [2020-02-10 19:31:06,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:06,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:06,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308280434] [2020-02-10 19:31:06,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:06,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:06,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:06,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:06,501 INFO L87 Difference]: Start difference. First operand 3127 states and 15611 transitions. Second operand 12 states. [2020-02-10 19:31:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:06,776 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-02-10 19:31:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:06,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:06,792 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 19:31:06,792 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:31:06,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:31:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-02-10 19:31:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:31:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15624 transitions. [2020-02-10 19:31:07,010 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15624 transitions. Word has length 31 [2020-02-10 19:31:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:07,011 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15624 transitions. [2020-02-10 19:31:07,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15624 transitions. [2020-02-10 19:31:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:07,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:07,016 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:07,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:07,016 INFO L82 PathProgramCache]: Analyzing trace with hash -413706650, now seen corresponding path program 40 times [2020-02-10 19:31:07,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:07,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003251327] [2020-02-10 19:31:07,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:07,597 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:07,728 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:31:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:07,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003251327] [2020-02-10 19:31:07,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:07,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:07,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089659654] [2020-02-10 19:31:07,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:07,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:07,739 INFO L87 Difference]: Start difference. First operand 3134 states and 15624 transitions. Second operand 12 states. [2020-02-10 19:31:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:08,058 INFO L93 Difference]: Finished difference Result 6054 states and 26960 transitions. [2020-02-10 19:31:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:08,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:08,074 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:31:08,074 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 19:31:08,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 19:31:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-02-10 19:31:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:31:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-02-10 19:31:08,289 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-02-10 19:31:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:08,289 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-02-10 19:31:08,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-02-10 19:31:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:08,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:08,295 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:08,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:08,295 INFO L82 PathProgramCache]: Analyzing trace with hash -629513288, now seen corresponding path program 41 times [2020-02-10 19:31:08,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:08,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421499585] [2020-02-10 19:31:08,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:08,859 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:08,990 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:31:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:09,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421499585] [2020-02-10 19:31:09,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:09,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:09,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225033810] [2020-02-10 19:31:09,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:09,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:09,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:09,001 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:31:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:09,236 INFO L93 Difference]: Finished difference Result 6050 states and 26952 transitions. [2020-02-10 19:31:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:09,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:09,252 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 19:31:09,253 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 19:31:09,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 19:31:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3133. [2020-02-10 19:31:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:31:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15616 transitions. [2020-02-10 19:31:09,468 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15616 transitions. Word has length 31 [2020-02-10 19:31:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:09,469 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15616 transitions. [2020-02-10 19:31:09,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15616 transitions. [2020-02-10 19:31:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:09,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:09,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:09,474 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1474484740, now seen corresponding path program 42 times [2020-02-10 19:31:09,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:09,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484568236] [2020-02-10 19:31:09,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:10,030 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:10,164 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:31:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:10,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484568236] [2020-02-10 19:31:10,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:10,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:10,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134574239] [2020-02-10 19:31:10,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:10,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:10,174 INFO L87 Difference]: Start difference. First operand 3133 states and 15616 transitions. Second operand 12 states. [2020-02-10 19:31:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:10,437 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-02-10 19:31:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:10,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:10,452 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:31:10,452 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 19:31:10,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 19:31:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3121. [2020-02-10 19:31:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:31:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15588 transitions. [2020-02-10 19:31:10,661 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15588 transitions. Word has length 31 [2020-02-10 19:31:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:10,661 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15588 transitions. [2020-02-10 19:31:10,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15588 transitions. [2020-02-10 19:31:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:10,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:10,667 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1486522654, now seen corresponding path program 43 times [2020-02-10 19:31:10,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:10,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345829326] [2020-02-10 19:31:10,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:11,205 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:11,334 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:11,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 19:31:11,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345829326] [2020-02-10 19:31:11,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:11,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:11,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401608137] [2020-02-10 19:31:11,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:11,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:11,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:11,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:11,345 INFO L87 Difference]: Start difference. First operand 3121 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:31:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:11,640 INFO L93 Difference]: Finished difference Result 6056 states and 26970 transitions. [2020-02-10 19:31:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:11,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:11,656 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:31:11,656 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:31:11,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:31:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-02-10 19:31:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:31:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15622 transitions. [2020-02-10 19:31:11,874 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15622 transitions. Word has length 31 [2020-02-10 19:31:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:11,874 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15622 transitions. [2020-02-10 19:31:11,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15622 transitions. [2020-02-10 19:31:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:11,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:11,880 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:11,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1963473190, now seen corresponding path program 44 times [2020-02-10 19:31:11,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:11,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61891296] [2020-02-10 19:31:11,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:12,435 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:31:12,570 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:12,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61891296] [2020-02-10 19:31:12,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:12,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13047911] [2020-02-10 19:31:12,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:12,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:12,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:12,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:12,581 INFO L87 Difference]: Start difference. First operand 3133 states and 15622 transitions. Second operand 12 states. [2020-02-10 19:31:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:12,876 INFO L93 Difference]: Finished difference Result 6053 states and 26958 transitions. [2020-02-10 19:31:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:12,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:12,892 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:31:12,892 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:31:12,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:31:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3127. [2020-02-10 19:31:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:31:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-02-10 19:31:13,119 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-02-10 19:31:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:13,119 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-02-10 19:31:13,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-02-10 19:31:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:13,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:13,125 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1910833890, now seen corresponding path program 45 times [2020-02-10 19:31:13,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:13,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035578687] [2020-02-10 19:31:13,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:13,705 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:13,838 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:13,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035578687] [2020-02-10 19:31:13,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:13,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:13,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422360499] [2020-02-10 19:31:13,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:13,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:13,849 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:31:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:14,222 INFO L93 Difference]: Finished difference Result 6058 states and 26969 transitions. [2020-02-10 19:31:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:14,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:14,239 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 19:31:14,239 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:31:14,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:31:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3134. [2020-02-10 19:31:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:31:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-02-10 19:31:14,456 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-02-10 19:31:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:14,456 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-02-10 19:31:14,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-02-10 19:31:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:14,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:14,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:14,462 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:14,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:14,462 INFO L82 PathProgramCache]: Analyzing trace with hash 694190502, now seen corresponding path program 46 times [2020-02-10 19:31:14,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:14,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404573820] [2020-02-10 19:31:14,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:15,019 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:15,152 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:15,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404573820] [2020-02-10 19:31:15,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:15,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:15,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812629309] [2020-02-10 19:31:15,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:15,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:15,163 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-02-10 19:31:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:15,416 INFO L93 Difference]: Finished difference Result 6056 states and 26958 transitions. [2020-02-10 19:31:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:15,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:15,431 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:31:15,432 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 19:31:15,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 19:31:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-02-10 19:31:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:31:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15599 transitions. [2020-02-10 19:31:15,649 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15599 transitions. Word has length 31 [2020-02-10 19:31:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:15,649 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15599 transitions. [2020-02-10 19:31:15,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15599 transitions. [2020-02-10 19:31:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:15,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:15,655 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1114850718, now seen corresponding path program 47 times [2020-02-10 19:31:15,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:15,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251294132] [2020-02-10 19:31:15,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:16,229 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:31:16,359 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:16,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251294132] [2020-02-10 19:31:16,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:16,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:16,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826283377] [2020-02-10 19:31:16,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:16,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:16,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:16,371 INFO L87 Difference]: Start difference. First operand 3127 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:31:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:16,692 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-02-10 19:31:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:16,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:16,710 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:31:16,710 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:31:16,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:31:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 19:31:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:31:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15610 transitions. [2020-02-10 19:31:16,939 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15610 transitions. Word has length 31 [2020-02-10 19:31:16,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:16,939 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15610 transitions. [2020-02-10 19:31:16,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15610 transitions. [2020-02-10 19:31:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:16,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:16,945 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 269879266, now seen corresponding path program 48 times [2020-02-10 19:31:16,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:16,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005468186] [2020-02-10 19:31:16,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:17,529 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:17,659 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:17,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 19:31:17,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005468186] [2020-02-10 19:31:17,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:17,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:17,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644398614] [2020-02-10 19:31:17,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:17,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:17,669 INFO L87 Difference]: Start difference. First operand 3133 states and 15610 transitions. Second operand 12 states. [2020-02-10 19:31:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:17,931 INFO L93 Difference]: Finished difference Result 6052 states and 26944 transitions. [2020-02-10 19:31:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:17,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:17,946 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 19:31:17,947 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:31:17,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:31:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3115. [2020-02-10 19:31:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:31:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15571 transitions. [2020-02-10 19:31:18,156 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15571 transitions. Word has length 31 [2020-02-10 19:31:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:18,156 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15571 transitions. [2020-02-10 19:31:18,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15571 transitions. [2020-02-10 19:31:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:18,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:18,161 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:18,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2124449198, now seen corresponding path program 49 times [2020-02-10 19:31:18,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:18,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043622433] [2020-02-10 19:31:18,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:18,743 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:18,874 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:31:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:18,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043622433] [2020-02-10 19:31:18,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:18,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:18,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433013386] [2020-02-10 19:31:18,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:18,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:18,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:18,886 INFO L87 Difference]: Start difference. First operand 3115 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:31:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:19,190 INFO L93 Difference]: Finished difference Result 6082 states and 27045 transitions. [2020-02-10 19:31:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:19,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:19,204 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:31:19,204 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 19:31:19,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 19:31:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3138. [2020-02-10 19:31:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:31:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-02-10 19:31:19,422 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-02-10 19:31:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:19,422 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-02-10 19:31:19,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-02-10 19:31:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:19,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:19,428 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash 903060920, now seen corresponding path program 50 times [2020-02-10 19:31:19,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:19,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289586989] [2020-02-10 19:31:19,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:20,014 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:20,148 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:20,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289586989] [2020-02-10 19:31:20,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:20,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:20,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831456541] [2020-02-10 19:31:20,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:20,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:20,159 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-02-10 19:31:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:20,464 INFO L93 Difference]: Finished difference Result 6083 states and 27039 transitions. [2020-02-10 19:31:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:20,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:20,479 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 19:31:20,479 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 19:31:20,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 19:31:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3130. [2020-02-10 19:31:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:31:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15626 transitions. [2020-02-10 19:31:20,756 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15626 transitions. Word has length 31 [2020-02-10 19:31:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:20,756 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15626 transitions. [2020-02-10 19:31:20,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15626 transitions. [2020-02-10 19:31:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:20,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:20,762 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:20,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1746206862, now seen corresponding path program 51 times [2020-02-10 19:31:20,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:20,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642021004] [2020-02-10 19:31:20,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:21,315 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:21,446 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:31:21,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 19:31:21,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642021004] [2020-02-10 19:31:21,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:21,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:21,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510068993] [2020-02-10 19:31:21,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:21,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:21,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:21,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:21,457 INFO L87 Difference]: Start difference. First operand 3130 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:31:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:21,701 INFO L93 Difference]: Finished difference Result 6077 states and 27027 transitions. [2020-02-10 19:31:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:21,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:21,717 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 19:31:21,717 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 19:31:21,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 19:31:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3136. [2020-02-10 19:31:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:31:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15637 transitions. [2020-02-10 19:31:21,927 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15637 transitions. Word has length 31 [2020-02-10 19:31:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:21,927 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15637 transitions. [2020-02-10 19:31:21,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15637 transitions. [2020-02-10 19:31:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:21,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:21,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:21,932 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:21,933 INFO L82 PathProgramCache]: Analyzing trace with hash -366221768, now seen corresponding path program 52 times [2020-02-10 19:31:21,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:21,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115017353] [2020-02-10 19:31:21,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:22,497 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:22,630 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:31:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:22,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115017353] [2020-02-10 19:31:22,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:22,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:22,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706934576] [2020-02-10 19:31:22,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:22,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:22,641 INFO L87 Difference]: Start difference. First operand 3136 states and 15637 transitions. Second operand 12 states. [2020-02-10 19:31:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:22,954 INFO L93 Difference]: Finished difference Result 6075 states and 27017 transitions. [2020-02-10 19:31:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:22,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:22,968 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 19:31:22,968 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 19:31:22,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 19:31:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-02-10 19:31:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:31:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15620 transitions. [2020-02-10 19:31:23,177 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15620 transitions. Word has length 31 [2020-02-10 19:31:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:23,177 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15620 transitions. [2020-02-10 19:31:23,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15620 transitions. [2020-02-10 19:31:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:23,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:23,183 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -157717170, now seen corresponding path program 53 times [2020-02-10 19:31:23,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:23,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525043925] [2020-02-10 19:31:23,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:23,752 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:23,886 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:23,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525043925] [2020-02-10 19:31:23,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:23,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:23,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394871388] [2020-02-10 19:31:23,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:23,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:23,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:23,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:23,897 INFO L87 Difference]: Start difference. First operand 3130 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:31:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:24,179 INFO L93 Difference]: Finished difference Result 6079 states and 27025 transitions. [2020-02-10 19:31:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:24,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:24,194 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:31:24,194 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 19:31:24,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 19:31:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3136. [2020-02-10 19:31:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:31:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15631 transitions. [2020-02-10 19:31:24,406 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15631 transitions. Word has length 31 [2020-02-10 19:31:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:24,406 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15631 transitions. [2020-02-10 19:31:24,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15631 transitions. [2020-02-10 19:31:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:24,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:24,412 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1002688622, now seen corresponding path program 54 times [2020-02-10 19:31:24,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:24,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851396906] [2020-02-10 19:31:24,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:25,091 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:25,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 19:31:25,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851396906] [2020-02-10 19:31:25,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:25,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:25,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010731903] [2020-02-10 19:31:25,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:25,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:25,103 INFO L87 Difference]: Start difference. First operand 3136 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:31:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:25,404 INFO L93 Difference]: Finished difference Result 6076 states and 27013 transitions. [2020-02-10 19:31:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:25,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:25,419 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 19:31:25,419 INFO L226 Difference]: Without dead ends: 6047 [2020-02-10 19:31:25,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-02-10 19:31:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3124. [2020-02-10 19:31:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:31:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15603 transitions. [2020-02-10 19:31:25,636 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15603 transitions. Word has length 31 [2020-02-10 19:31:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:25,637 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15603 transitions. [2020-02-10 19:31:25,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15603 transitions. [2020-02-10 19:31:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:25,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:25,642 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash -648831620, now seen corresponding path program 55 times [2020-02-10 19:31:25,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:25,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43529605] [2020-02-10 19:31:25,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:26,225 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:31:26,352 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:31:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:26,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43529605] [2020-02-10 19:31:26,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:26,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:26,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542848095] [2020-02-10 19:31:26,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:26,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:26,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:26,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:26,364 INFO L87 Difference]: Start difference. First operand 3124 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:31:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:26,744 INFO L93 Difference]: Finished difference Result 6100 states and 27082 transitions. [2020-02-10 19:31:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:26,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:26,762 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 19:31:26,762 INFO L226 Difference]: Without dead ends: 6081 [2020-02-10 19:31:26,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2020-02-10 19:31:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3143. [2020-02-10 19:31:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:31:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15655 transitions. [2020-02-10 19:31:26,972 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15655 transitions. Word has length 31 [2020-02-10 19:31:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:26,972 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15655 transitions. [2020-02-10 19:31:26,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15655 transitions. [2020-02-10 19:31:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:26,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:26,978 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1916288798, now seen corresponding path program 56 times [2020-02-10 19:31:26,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:26,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254650600] [2020-02-10 19:31:26,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:27,285 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 19:31:27,729 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:27,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254650600] [2020-02-10 19:31:27,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:27,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:27,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878153018] [2020-02-10 19:31:27,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:27,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:27,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:27,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:27,740 INFO L87 Difference]: Start difference. First operand 3143 states and 15655 transitions. Second operand 12 states. [2020-02-10 19:31:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:28,110 INFO L93 Difference]: Finished difference Result 6101 states and 27076 transitions. [2020-02-10 19:31:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:28,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:28,125 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 19:31:28,125 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 19:31:28,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 19:31:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3135. [2020-02-10 19:31:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:31:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15632 transitions. [2020-02-10 19:31:28,346 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15632 transitions. Word has length 31 [2020-02-10 19:31:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:28,346 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15632 transitions. [2020-02-10 19:31:28,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15632 transitions. [2020-02-10 19:31:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:28,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:28,352 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:28,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:28,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2133920946, now seen corresponding path program 57 times [2020-02-10 19:31:28,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:28,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762403005] [2020-02-10 19:31:28,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:28,931 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:29,063 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:29,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762403005] [2020-02-10 19:31:29,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:29,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:29,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314044627] [2020-02-10 19:31:29,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:29,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:29,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:29,074 INFO L87 Difference]: Start difference. First operand 3135 states and 15632 transitions. Second operand 12 states. [2020-02-10 19:31:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:29,445 INFO L93 Difference]: Finished difference Result 6103 states and 27079 transitions. [2020-02-10 19:31:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:29,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:29,461 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 19:31:29,461 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 19:31:29,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 19:31:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3144. [2020-02-10 19:31:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 19:31:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15649 transitions. [2020-02-10 19:31:29,679 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15649 transitions. Word has length 31 [2020-02-10 19:31:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:29,679 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15649 transitions. [2020-02-10 19:31:29,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15649 transitions. [2020-02-10 19:31:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:29,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:29,685 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:29,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:29,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2063810910, now seen corresponding path program 58 times [2020-02-10 19:31:29,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:29,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706672173] [2020-02-10 19:31:29,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:30,255 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:31:30,387 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:30,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 19:31:30,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706672173] [2020-02-10 19:31:30,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:30,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:30,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588170353] [2020-02-10 19:31:30,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:30,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:30,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:30,398 INFO L87 Difference]: Start difference. First operand 3144 states and 15649 transitions. Second operand 12 states. [2020-02-10 19:31:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:30,729 INFO L93 Difference]: Finished difference Result 6106 states and 27076 transitions. [2020-02-10 19:31:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:30,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:30,744 INFO L225 Difference]: With dead ends: 6106 [2020-02-10 19:31:30,744 INFO L226 Difference]: Without dead ends: 6075 [2020-02-10 19:31:30,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-02-10 19:31:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3135. [2020-02-10 19:31:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:31:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15623 transitions. [2020-02-10 19:31:30,953 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15623 transitions. Word has length 31 [2020-02-10 19:31:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:30,953 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15623 transitions. [2020-02-10 19:31:30,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15623 transitions. [2020-02-10 19:31:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:30,959 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:30,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:30,959 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash 257122318, now seen corresponding path program 59 times [2020-02-10 19:31:30,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:30,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635515320] [2020-02-10 19:31:30,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:31,534 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:31,668 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:31,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635515320] [2020-02-10 19:31:31,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:31,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:31,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760233237] [2020-02-10 19:31:31,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:31,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:31,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:31,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:31,679 INFO L87 Difference]: Start difference. First operand 3135 states and 15623 transitions. Second operand 12 states. [2020-02-10 19:31:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:31,913 INFO L93 Difference]: Finished difference Result 6107 states and 27078 transitions. [2020-02-10 19:31:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:31,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:31,929 INFO L225 Difference]: With dead ends: 6107 [2020-02-10 19:31:31,929 INFO L226 Difference]: Without dead ends: 6087 [2020-02-10 19:31:31,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6087 states. [2020-02-10 19:31:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6087 to 3146. [2020-02-10 19:31:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 19:31:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15643 transitions. [2020-02-10 19:31:32,138 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15643 transitions. Word has length 31 [2020-02-10 19:31:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:32,138 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15643 transitions. [2020-02-10 19:31:32,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15643 transitions. [2020-02-10 19:31:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:32,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:32,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:32,144 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:32,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1594689532, now seen corresponding path program 60 times [2020-02-10 19:31:32,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:32,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415587185] [2020-02-10 19:31:32,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:32,725 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:31:32,858 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:31:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:32,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415587185] [2020-02-10 19:31:32,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:32,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:32,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061646768] [2020-02-10 19:31:32,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:32,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:32,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:32,869 INFO L87 Difference]: Start difference. First operand 3146 states and 15643 transitions. Second operand 12 states. [2020-02-10 19:31:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:33,080 INFO L93 Difference]: Finished difference Result 6109 states and 27072 transitions. [2020-02-10 19:31:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:33,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:33,095 INFO L225 Difference]: With dead ends: 6109 [2020-02-10 19:31:33,096 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 19:31:33,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 19:31:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3124. [2020-02-10 19:31:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:31:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 19:31:33,311 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 19:31:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:33,312 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 19:31:33,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 19:31:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:33,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:33,317 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:33,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1341889284, now seen corresponding path program 61 times [2020-02-10 19:31:33,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:33,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258031499] [2020-02-10 19:31:33,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:33,868 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:33,999 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:34,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258031499] [2020-02-10 19:31:34,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:34,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:34,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606381818] [2020-02-10 19:31:34,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:34,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:34,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:34,009 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:31:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:34,277 INFO L93 Difference]: Finished difference Result 6082 states and 27028 transitions. [2020-02-10 19:31:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:34,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:34,292 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:31:34,292 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 19:31:34,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 19:31:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3137. [2020-02-10 19:31:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:31:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15631 transitions. [2020-02-10 19:31:34,518 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15631 transitions. Word has length 31 [2020-02-10 19:31:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:34,518 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15631 transitions. [2020-02-10 19:31:34,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15631 transitions. [2020-02-10 19:31:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:34,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:34,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:34,524 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:34,525 INFO L82 PathProgramCache]: Analyzing trace with hash 840649382, now seen corresponding path program 62 times [2020-02-10 19:31:34,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:34,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188249773] [2020-02-10 19:31:34,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:35,069 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:35,201 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:35,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188249773] [2020-02-10 19:31:35,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:35,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:35,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512984811] [2020-02-10 19:31:35,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:35,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:35,211 INFO L87 Difference]: Start difference. First operand 3137 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:31:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:35,437 INFO L93 Difference]: Finished difference Result 6080 states and 27018 transitions. [2020-02-10 19:31:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:35,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:35,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:35,453 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 19:31:35,453 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 19:31:35,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 19:31:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3131. [2020-02-10 19:31:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:31:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-02-10 19:31:35,666 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-02-10 19:31:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:35,666 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-02-10 19:31:35,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-02-10 19:31:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:35,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:35,672 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1892299922, now seen corresponding path program 63 times [2020-02-10 19:31:35,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:35,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433472206] [2020-02-10 19:31:35,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:36,226 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:36,359 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:36,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433472206] [2020-02-10 19:31:36,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:36,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:36,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244955133] [2020-02-10 19:31:36,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:36,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:36,370 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-02-10 19:31:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:36,591 INFO L93 Difference]: Finished difference Result 6090 states and 27039 transitions. [2020-02-10 19:31:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:36,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:36,605 INFO L225 Difference]: With dead ends: 6090 [2020-02-10 19:31:36,606 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 19:31:36,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 19:31:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-02-10 19:31:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:31:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15631 transitions. [2020-02-10 19:31:36,820 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15631 transitions. Word has length 31 [2020-02-10 19:31:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:36,820 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15631 transitions. [2020-02-10 19:31:36,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15631 transitions. [2020-02-10 19:31:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:36,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:36,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:36,825 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1962409958, now seen corresponding path program 64 times [2020-02-10 19:31:36,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:36,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964010669] [2020-02-10 19:31:36,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:37,379 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:31:37,512 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:37,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 19:31:37,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964010669] [2020-02-10 19:31:37,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:37,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:37,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454168173] [2020-02-10 19:31:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:37,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:37,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:37,523 INFO L87 Difference]: Start difference. First operand 3140 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:31:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:37,718 INFO L93 Difference]: Finished difference Result 6093 states and 27036 transitions. [2020-02-10 19:31:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:37,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:37,733 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 19:31:37,734 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 19:31:37,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 19:31:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3131. [2020-02-10 19:31:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:31:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 19:31:37,955 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 19:31:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:37,956 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 19:31:37,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 19:31:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:37,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:37,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:37,961 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1280906798, now seen corresponding path program 65 times [2020-02-10 19:31:37,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:37,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196835379] [2020-02-10 19:31:37,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:38,515 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:38,651 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31: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 19:31:38,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196835379] [2020-02-10 19:31:38,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:38,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:38,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118675201] [2020-02-10 19:31:38,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:38,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:38,663 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:31:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:38,889 INFO L93 Difference]: Finished difference Result 6084 states and 27018 transitions. [2020-02-10 19:31:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:38,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:38,904 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 19:31:38,904 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 19:31:38,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 19:31:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3138. [2020-02-10 19:31:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:31:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15620 transitions. [2020-02-10 19:31:39,122 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15620 transitions. Word has length 31 [2020-02-10 19:31:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:39,122 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15620 transitions. [2020-02-10 19:31:39,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15620 transitions. [2020-02-10 19:31:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:39,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:39,128 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash 901631868, now seen corresponding path program 66 times [2020-02-10 19:31:39,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:39,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640000239] [2020-02-10 19:31:39,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:39,677 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:31:39,807 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:39,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 19:31:39,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640000239] [2020-02-10 19:31:39,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:39,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:39,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312353651] [2020-02-10 19:31:39,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:39,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:39,818 INFO L87 Difference]: Start difference. First operand 3138 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:31:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:40,088 INFO L93 Difference]: Finished difference Result 6089 states and 27021 transitions. [2020-02-10 19:31:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:40,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:40,103 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 19:31:40,103 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 19:31:40,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 19:31:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3124. [2020-02-10 19:31:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:31:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15587 transitions. [2020-02-10 19:31:40,326 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15587 transitions. Word has length 31 [2020-02-10 19:31:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:40,382 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15587 transitions. [2020-02-10 19:31:40,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15587 transitions. [2020-02-10 19:31:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:40,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:40,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:40,388 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:40,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1501449310, now seen corresponding path program 67 times [2020-02-10 19:31:40,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:40,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670571272] [2020-02-10 19:31:40,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:40,968 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:41,092 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:41,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670571272] [2020-02-10 19:31:41,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:41,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:41,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752832383] [2020-02-10 19:31:41,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:41,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:41,104 INFO L87 Difference]: Start difference. First operand 3124 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:31:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:41,375 INFO L93 Difference]: Finished difference Result 6088 states and 27033 transitions. [2020-02-10 19:31:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:41,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:41,391 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 19:31:41,391 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 19:31:41,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 19:31:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3138. [2020-02-10 19:31:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:31:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-02-10 19:31:41,602 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-02-10 19:31:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:41,602 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-02-10 19:31:41,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-02-10 19:31:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:41,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:41,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:41,607 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1948546534, now seen corresponding path program 68 times [2020-02-10 19:31:41,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:41,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233853760] [2020-02-10 19:31:41,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:42,167 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:42,300 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:42,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233853760] [2020-02-10 19:31:42,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:42,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:42,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022002522] [2020-02-10 19:31:42,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:42,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:42,311 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:31:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:42,535 INFO L93 Difference]: Finished difference Result 6085 states and 27021 transitions. [2020-02-10 19:31:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:42,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:42,550 INFO L225 Difference]: With dead ends: 6085 [2020-02-10 19:31:42,550 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 19:31:42,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 19:31:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3132. [2020-02-10 19:31:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:31:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15609 transitions. [2020-02-10 19:31:42,760 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15609 transitions. Word has length 31 [2020-02-10 19:31:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:42,760 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15609 transitions. [2020-02-10 19:31:42,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15609 transitions. [2020-02-10 19:31:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:42,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:42,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:42,765 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1732739896, now seen corresponding path program 69 times [2020-02-10 19:31:42,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:42,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353747905] [2020-02-10 19:31:42,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:43,325 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:43,457 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:43,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353747905] [2020-02-10 19:31:43,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:43,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:43,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859997065] [2020-02-10 19:31:43,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:43,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:43,467 INFO L87 Difference]: Start difference. First operand 3132 states and 15609 transitions. Second operand 12 states. [2020-02-10 19:31:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:43,715 INFO L93 Difference]: Finished difference Result 6098 states and 27048 transitions. [2020-02-10 19:31:43,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:43,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:43,729 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 19:31:43,729 INFO L226 Difference]: Without dead ends: 6078 [2020-02-10 19:31:43,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-02-10 19:31:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3143. [2020-02-10 19:31:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:31:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15629 transitions. [2020-02-10 19:31:43,945 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15629 transitions. Word has length 31 [2020-02-10 19:31:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:43,945 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15629 transitions. [2020-02-10 19:31:43,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15629 transitions. [2020-02-10 19:31:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:43,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:43,951 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1224660186, now seen corresponding path program 70 times [2020-02-10 19:31:43,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:43,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590736931] [2020-02-10 19:31:43,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:44,525 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:31:44,652 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:31:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:44,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590736931] [2020-02-10 19:31:44,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:44,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:44,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060229524] [2020-02-10 19:31:44,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:44,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:44,663 INFO L87 Difference]: Start difference. First operand 3143 states and 15629 transitions. Second operand 12 states. [2020-02-10 19:31:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:44,907 INFO L93 Difference]: Finished difference Result 6100 states and 27042 transitions. [2020-02-10 19:31:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:44,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:44,923 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 19:31:44,923 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 19:31:44,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 19:31:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3132. [2020-02-10 19:31:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:31:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 19:31:45,140 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 19:31:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:45,141 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 19:31:45,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 19:31:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:45,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:45,146 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:45,146 INFO L82 PathProgramCache]: Analyzing trace with hash 463457208, now seen corresponding path program 71 times [2020-02-10 19:31:45,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:45,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183804572] [2020-02-10 19:31:45,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:45,785 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:31:45,917 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:31:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:45,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183804572] [2020-02-10 19:31:45,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:45,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:45,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108589164] [2020-02-10 19:31:45,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:45,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:45,928 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:31:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:46,159 INFO L93 Difference]: Finished difference Result 6088 states and 27018 transitions. [2020-02-10 19:31:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:46,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:46,174 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 19:31:46,174 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 19:31:46,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 19:31:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3139. [2020-02-10 19:31:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 19:31:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15614 transitions. [2020-02-10 19:31:46,390 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15614 transitions. Word has length 31 [2020-02-10 19:31:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:46,390 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15614 transitions. [2020-02-10 19:31:46,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15614 transitions. [2020-02-10 19:31:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:46,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:46,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:46,396 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1648971422, now seen corresponding path program 72 times [2020-02-10 19:31:46,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:46,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415962267] [2020-02-10 19:31:46,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:46,961 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:31:47,152 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:31:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:47,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415962267] [2020-02-10 19:31:47,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:47,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:47,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728858975] [2020-02-10 19:31:47,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:47,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:47,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:47,163 INFO L87 Difference]: Start difference. First operand 3139 states and 15614 transitions. Second operand 12 states. [2020-02-10 19:31:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:47,360 INFO L93 Difference]: Finished difference Result 6093 states and 27021 transitions. [2020-02-10 19:31:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:47,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:47,375 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 19:31:47,375 INFO L226 Difference]: Without dead ends: 6047 [2020-02-10 19:31:47,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-02-10 19:31:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3115. [2020-02-10 19:31:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:31:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15562 transitions. [2020-02-10 19:31:47,592 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15562 transitions. Word has length 31 [2020-02-10 19:31:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:47,592 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15562 transitions. [2020-02-10 19:31:47,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15562 transitions. [2020-02-10 19:31:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:47,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:47,598 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1726304654, now seen corresponding path program 73 times [2020-02-10 19:31:47,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:47,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964369606] [2020-02-10 19:31:47,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:48,143 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:48,276 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:48,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 19:31:48,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964369606] [2020-02-10 19:31:48,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:48,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:48,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144564232] [2020-02-10 19:31:48,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:48,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:48,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:48,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:48,286 INFO L87 Difference]: Start difference. First operand 3115 states and 15562 transitions. Second operand 12 states. [2020-02-10 19:31:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:48,529 INFO L93 Difference]: Finished difference Result 6062 states and 26989 transitions. [2020-02-10 19:31:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:48,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:48,543 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:31:48,544 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 19:31:48,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 19:31:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3134. [2020-02-10 19:31:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:31:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-02-10 19:31:48,754 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-02-10 19:31:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:48,754 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-02-10 19:31:48,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-02-10 19:31:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:48,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:48,759 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash -386123976, now seen corresponding path program 74 times [2020-02-10 19:31:48,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:48,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801952313] [2020-02-10 19:31:48,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:49,310 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:49,439 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:49,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801952313] [2020-02-10 19:31:49,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:49,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:49,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094257960] [2020-02-10 19:31:49,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:49,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:49,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:49,451 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-02-10 19:31:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:49,749 INFO L93 Difference]: Finished difference Result 6060 states and 26979 transitions. [2020-02-10 19:31:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:49,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:49,765 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 19:31:49,765 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 19:31:49,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 19:31:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3128. [2020-02-10 19:31:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:31:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15612 transitions. [2020-02-10 19:31:49,974 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15612 transitions. Word has length 31 [2020-02-10 19:31:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:49,975 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15612 transitions. [2020-02-10 19:31:49,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15612 transitions. [2020-02-10 19:31:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:49,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:49,980 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:49,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1301993418, now seen corresponding path program 75 times [2020-02-10 19:31:49,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:49,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206182728] [2020-02-10 19:31:49,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:50,558 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:50,689 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:31:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:50,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206182728] [2020-02-10 19:31:50,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:50,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:50,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178962907] [2020-02-10 19:31:50,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:50,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:50,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:50,700 INFO L87 Difference]: Start difference. First operand 3128 states and 15612 transitions. Second operand 12 states. [2020-02-10 19:31:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:50,950 INFO L93 Difference]: Finished difference Result 6064 states and 26988 transitions. [2020-02-10 19:31:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:50,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:50,965 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 19:31:50,965 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 19:31:50,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 19:31:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3135. [2020-02-10 19:31:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:31:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-02-10 19:31:51,174 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-02-10 19:31:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:51,175 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-02-10 19:31:51,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-02-10 19:31:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:51,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:51,180 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:51,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:51,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1655406664, now seen corresponding path program 76 times [2020-02-10 19:31:51,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:51,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579421823] [2020-02-10 19:31:51,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:51,729 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:51,857 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31: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 19:31:51,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579421823] [2020-02-10 19:31:51,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:51,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:51,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405274323] [2020-02-10 19:31:51,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:51,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:51,869 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-02-10 19:31:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:52,116 INFO L93 Difference]: Finished difference Result 6063 states and 26979 transitions. [2020-02-10 19:31:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:52,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:52,132 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 19:31:52,132 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:31:52,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:31:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-02-10 19:31:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:31:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15606 transitions. [2020-02-10 19:31:52,342 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15606 transitions. Word has length 31 [2020-02-10 19:31:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:52,343 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15606 transitions. [2020-02-10 19:31:52,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15606 transitions. [2020-02-10 19:31:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:52,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:52,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:52,349 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1871213302, now seen corresponding path program 77 times [2020-02-10 19:31:52,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:52,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592576222] [2020-02-10 19:31:52,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:52,905 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:31:53,038 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:53,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592576222] [2020-02-10 19:31:53,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:53,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:53,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305191194] [2020-02-10 19:31:53,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:53,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:53,049 INFO L87 Difference]: Start difference. First operand 3128 states and 15606 transitions. Second operand 12 states. [2020-02-10 19:31:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:53,330 INFO L93 Difference]: Finished difference Result 6059 states and 26971 transitions. [2020-02-10 19:31:53,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:53,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:53,345 INFO L225 Difference]: With dead ends: 6059 [2020-02-10 19:31:53,345 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 19:31:53,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 19:31:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3134. [2020-02-10 19:31:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:31:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15617 transitions. [2020-02-10 19:31:53,630 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15617 transitions. Word has length 31 [2020-02-10 19:31:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:53,630 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15617 transitions. [2020-02-10 19:31:53,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15617 transitions. [2020-02-10 19:31:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:53,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:53,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:53,636 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1578782542, now seen corresponding path program 78 times [2020-02-10 19:31:53,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:53,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522178649] [2020-02-10 19:31:53,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:54,185 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:54,315 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:31:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:54,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522178649] [2020-02-10 19:31:54,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:54,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:54,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68104343] [2020-02-10 19:31:54,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:54,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:54,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:54,325 INFO L87 Difference]: Start difference. First operand 3134 states and 15617 transitions. Second operand 12 states. [2020-02-10 19:31:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:54,561 INFO L93 Difference]: Finished difference Result 6060 states and 26967 transitions. [2020-02-10 19:31:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:54,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:54,576 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 19:31:54,576 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:31:54,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:31:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3122. [2020-02-10 19:31:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:31:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15589 transitions. [2020-02-10 19:31:54,792 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15589 transitions. Word has length 31 [2020-02-10 19:31:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:54,792 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15589 transitions. [2020-02-10 19:31:54,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15589 transitions. [2020-02-10 19:31:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:54,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:54,798 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash -824298636, now seen corresponding path program 79 times [2020-02-10 19:31:54,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:54,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572909173] [2020-02-10 19:31:54,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:55,338 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:55,471 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:55,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572909173] [2020-02-10 19:31:55,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:55,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:55,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074718898] [2020-02-10 19:31:55,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:55,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:55,481 INFO L87 Difference]: Start difference. First operand 3122 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:31:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:55,734 INFO L93 Difference]: Finished difference Result 6070 states and 27000 transitions. [2020-02-10 19:31:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:55,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:55,749 INFO L225 Difference]: With dead ends: 6070 [2020-02-10 19:31:55,749 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 19:31:55,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 19:31:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-02-10 19:31:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:31:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-02-10 19:31:55,965 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-02-10 19:31:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:55,965 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-02-10 19:31:55,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-02-10 19:31:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:55,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:55,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:55,970 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1358240030, now seen corresponding path program 80 times [2020-02-10 19:31:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:55,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479093478] [2020-02-10 19:31:55,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:56,515 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:31:56,645 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:56,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479093478] [2020-02-10 19:31:56,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:56,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:56,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266058442] [2020-02-10 19:31:56,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:56,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:56,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:56,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:56,656 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:31:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:56,889 INFO L93 Difference]: Finished difference Result 6068 states and 26990 transitions. [2020-02-10 19:31:56,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:56,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:56,907 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 19:31:56,907 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 19:31:56,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 19:31:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-02-10 19:31:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:31:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15609 transitions. [2020-02-10 19:31:57,118 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15609 transitions. Word has length 31 [2020-02-10 19:31:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:57,118 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15609 transitions. [2020-02-10 19:31:57,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15609 transitions. [2020-02-10 19:31:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:57,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:57,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:57,124 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1885076726, now seen corresponding path program 81 times [2020-02-10 19:31:57,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:57,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482629009] [2020-02-10 19:31:57,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:57,686 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:31:57,818 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:57,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482629009] [2020-02-10 19:31:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:57,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420755647] [2020-02-10 19:31:57,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:57,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:57,829 INFO L87 Difference]: Start difference. First operand 3129 states and 15609 transitions. Second operand 12 states. [2020-02-10 19:31:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:58,065 INFO L93 Difference]: Finished difference Result 6078 states and 27011 transitions. [2020-02-10 19:31:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:58,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:58,081 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 19:31:58,081 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 19:31:58,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 19:31:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3138. [2020-02-10 19:31:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:31:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-02-10 19:31:58,296 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-02-10 19:31:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:58,297 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-02-10 19:31:58,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-02-10 19:31:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:58,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:58,302 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1814966690, now seen corresponding path program 82 times [2020-02-10 19:31:58,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:58,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822681387] [2020-02-10 19:31:58,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:31:58,561 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2020-02-10 19:31:58,738 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 19:31:59,133 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:31:59,264 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:31:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:31:59,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822681387] [2020-02-10 19:31:59,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:31:59,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:31:59,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186426449] [2020-02-10 19:31:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:31:59,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:31:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:31:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:31:59,275 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:31:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:31:59,480 INFO L93 Difference]: Finished difference Result 6081 states and 27008 transitions. [2020-02-10 19:31:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:31:59,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:31:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:31:59,495 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 19:31:59,496 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 19:31:59,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:31:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 19:31:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3129. [2020-02-10 19:31:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:31:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-02-10 19:31:59,712 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-02-10 19:31:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:31:59,712 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-02-10 19:31:59,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:31:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-02-10 19:31:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:31:59,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:31:59,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:31:59,720 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:31:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:31:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash -763316150, now seen corresponding path program 83 times [2020-02-10 19:31:59,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:31:59,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284189941] [2020-02-10 19:31:59,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:31:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:00,281 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:00,414 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:32:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:00,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284189941] [2020-02-10 19:32:00,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:00,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:00,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036632879] [2020-02-10 19:32:00,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:00,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:00,425 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-02-10 19:32:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:00,693 INFO L93 Difference]: Finished difference Result 6072 states and 26990 transitions. [2020-02-10 19:32:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:00,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:00,709 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 19:32:00,709 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 19:32:00,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 19:32:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3136. [2020-02-10 19:32:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:32:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15615 transitions. [2020-02-10 19:32:00,918 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15615 transitions. Word has length 31 [2020-02-10 19:32:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:00,919 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15615 transitions. [2020-02-10 19:32:00,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15615 transitions. [2020-02-10 19:32:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:00,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:00,924 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:00,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:00,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1419222516, now seen corresponding path program 84 times [2020-02-10 19:32:00,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:00,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134405197] [2020-02-10 19:32:00,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:01,472 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:32:01,600 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:32:01,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 19:32:01,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134405197] [2020-02-10 19:32:01,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:01,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:01,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954773305] [2020-02-10 19:32:01,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:01,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:01,610 INFO L87 Difference]: Start difference. First operand 3136 states and 15615 transitions. Second operand 12 states. [2020-02-10 19:32:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:01,834 INFO L93 Difference]: Finished difference Result 6077 states and 26993 transitions. [2020-02-10 19:32:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:01,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:01,849 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 19:32:01,850 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 19:32:01,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 19:32:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3122. [2020-02-10 19:32:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:32:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-02-10 19:32:02,059 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-02-10 19:32:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:02,059 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-02-10 19:32:02,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-02-10 19:32:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:02,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:02,065 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1517356300, now seen corresponding path program 85 times [2020-02-10 19:32:02,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:02,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463513567] [2020-02-10 19:32:02,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:02,617 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:02,746 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:32:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:02,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463513567] [2020-02-10 19:32:02,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:02,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:02,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432228208] [2020-02-10 19:32:02,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:02,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:02,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:02,758 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:32:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:03,058 INFO L93 Difference]: Finished difference Result 6076 states and 27010 transitions. [2020-02-10 19:32:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:03,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:03,073 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 19:32:03,073 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 19:32:03,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 19:32:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3137. [2020-02-10 19:32:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:32:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15625 transitions. [2020-02-10 19:32:03,280 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15625 transitions. Word has length 31 [2020-02-10 19:32:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:03,280 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15625 transitions. [2020-02-10 19:32:03,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15625 transitions. [2020-02-10 19:32:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:03,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:03,286 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash -179789086, now seen corresponding path program 86 times [2020-02-10 19:32:03,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:03,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405060826] [2020-02-10 19:32:03,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:03,852 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:03,982 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:03,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 19:32:03,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405060826] [2020-02-10 19:32:03,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:03,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:03,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108466248] [2020-02-10 19:32:03,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:03,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:03,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:03,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:03,993 INFO L87 Difference]: Start difference. First operand 3137 states and 15625 transitions. Second operand 12 states. [2020-02-10 19:32:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:04,290 INFO L93 Difference]: Finished difference Result 6075 states and 27001 transitions. [2020-02-10 19:32:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:04,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:04,306 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 19:32:04,306 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 19:32:04,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 19:32:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3130. [2020-02-10 19:32:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:32:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15605 transitions. [2020-02-10 19:32:04,523 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15605 transitions. Word has length 31 [2020-02-10 19:32:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:04,523 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15605 transitions. [2020-02-10 19:32:04,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15605 transitions. [2020-02-10 19:32:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:04,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:04,529 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2141144142, now seen corresponding path program 87 times [2020-02-10 19:32:04,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:04,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279497791] [2020-02-10 19:32:04,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:05,094 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:05,227 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:32:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:05,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279497791] [2020-02-10 19:32:05,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:05,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:05,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550660207] [2020-02-10 19:32:05,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:05,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:05,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:05,238 INFO L87 Difference]: Start difference. First operand 3130 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:32:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:05,495 INFO L93 Difference]: Finished difference Result 6082 states and 27015 transitions. [2020-02-10 19:32:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:05,496 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:05,511 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:32:05,511 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 19:32:05,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 19:32:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3139. [2020-02-10 19:32:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 19:32:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-02-10 19:32:05,721 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-02-10 19:32:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:05,721 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-02-10 19:32:05,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-02-10 19:32:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:05,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:05,726 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:05,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2083713118, now seen corresponding path program 88 times [2020-02-10 19:32:05,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:05,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815898849] [2020-02-10 19:32:05,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:06,268 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:32:06,449 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 19:32:06,589 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:32:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:06,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815898849] [2020-02-10 19:32:06,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:06,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:06,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880700003] [2020-02-10 19:32:06,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:06,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:06,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:06,601 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-02-10 19:32:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:06,828 INFO L93 Difference]: Finished difference Result 6085 states and 27012 transitions. [2020-02-10 19:32:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:06,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:06,843 INFO L225 Difference]: With dead ends: 6085 [2020-02-10 19:32:06,843 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 19:32:06,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 19:32:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3130. [2020-02-10 19:32:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:32:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-02-10 19:32:07,053 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-02-10 19:32:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:07,053 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-02-10 19:32:07,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-02-10 19:32:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:07,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:07,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:07,058 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1993622030, now seen corresponding path program 89 times [2020-02-10 19:32:07,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:07,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219049670] [2020-02-10 19:32:07,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:07,650 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:07,785 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:07,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219049670] [2020-02-10 19:32:07,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:07,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:07,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196483225] [2020-02-10 19:32:07,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:07,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:07,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:07,796 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-02-10 19:32:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:08,035 INFO L93 Difference]: Finished difference Result 6079 states and 27000 transitions. [2020-02-10 19:32:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:08,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:08,051 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:32:08,051 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 19:32:08,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 19:32:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-02-10 19:32:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:32:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-02-10 19:32:08,268 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-02-10 19:32:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:08,269 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-02-10 19:32:08,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-02-10 19:32:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:08,274 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:08,274 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:08,274 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 726164852, now seen corresponding path program 90 times [2020-02-10 19:32:08,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:08,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469861669] [2020-02-10 19:32:08,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:08,848 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:32:08,976 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:08,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469861669] [2020-02-10 19:32:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:08,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404871742] [2020-02-10 19:32:08,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:08,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:08,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:08,987 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-02-10 19:32:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:09,188 INFO L93 Difference]: Finished difference Result 6083 states and 27000 transitions. [2020-02-10 19:32:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:09,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:09,203 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 19:32:09,203 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 19:32:09,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 19:32:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3122. [2020-02-10 19:32:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:32:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-02-10 19:32:09,420 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-02-10 19:32:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:09,420 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-02-10 19:32:09,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-02-10 19:32:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:09,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:09,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:09,426 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1080021854, now seen corresponding path program 91 times [2020-02-10 19:32:09,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:09,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299868510] [2020-02-10 19:32:09,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:10,000 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:32:10,133 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:10,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299868510] [2020-02-10 19:32:10,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:10,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:10,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009158832] [2020-02-10 19:32:10,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:10,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:10,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:10,144 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:32:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:10,445 INFO L93 Difference]: Finished difference Result 6065 states and 26975 transitions. [2020-02-10 19:32:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:10,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:10,460 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 19:32:10,461 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 19:32:10,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 19:32:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3135. [2020-02-10 19:32:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:32:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15612 transitions. [2020-02-10 19:32:10,670 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15612 transitions. Word has length 31 [2020-02-10 19:32:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:10,670 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15612 transitions. [2020-02-10 19:32:10,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15612 transitions. [2020-02-10 19:32:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:10,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:10,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:10,676 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash 235050402, now seen corresponding path program 92 times [2020-02-10 19:32:10,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:10,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091546128] [2020-02-10 19:32:10,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:11,245 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:11,379 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:11,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091546128] [2020-02-10 19:32:11,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:11,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:11,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371139114] [2020-02-10 19:32:11,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:11,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:11,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:11,390 INFO L87 Difference]: Start difference. First operand 3135 states and 15612 transitions. Second operand 12 states. [2020-02-10 19:32:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:11,625 INFO L93 Difference]: Finished difference Result 6066 states and 26971 transitions. [2020-02-10 19:32:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:11,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:11,640 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 19:32:11,640 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 19:32:11,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 19:32:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3129. [2020-02-10 19:32:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:32:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-02-10 19:32:11,850 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-02-10 19:32:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:11,851 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-02-10 19:32:11,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-02-10 19:32:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:11,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:11,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:11,856 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 443555000, now seen corresponding path program 93 times [2020-02-10 19:32:11,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:11,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259016615] [2020-02-10 19:32:11,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:12,428 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:32:12,560 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:12,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259016615] [2020-02-10 19:32:12,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:12,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:12,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935848953] [2020-02-10 19:32:12,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:12,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:12,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:12,571 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:32:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:12,838 INFO L93 Difference]: Finished difference Result 6070 states and 26978 transitions. [2020-02-10 19:32:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:12,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:12,853 INFO L225 Difference]: With dead ends: 6070 [2020-02-10 19:32:12,853 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 19:32:12,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 19:32:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-02-10 19:32:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:32:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15608 transitions. [2020-02-10 19:32:13,070 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15608 transitions. Word has length 31 [2020-02-10 19:32:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:13,070 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15608 transitions. [2020-02-10 19:32:13,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15608 transitions. [2020-02-10 19:32:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:13,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:13,076 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1668873630, now seen corresponding path program 94 times [2020-02-10 19:32:13,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:13,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371174054] [2020-02-10 19:32:13,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:13,629 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:32:13,759 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:13,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371174054] [2020-02-10 19:32:13,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:13,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:13,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155210224] [2020-02-10 19:32:13,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:13,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:13,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:13,770 INFO L87 Difference]: Start difference. First operand 3136 states and 15608 transitions. Second operand 12 states. [2020-02-10 19:32:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:14,012 INFO L93 Difference]: Finished difference Result 6075 states and 26981 transitions. [2020-02-10 19:32:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:14,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:14,027 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 19:32:14,027 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 19:32:14,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 19:32:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-02-10 19:32:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:32:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 19:32:14,283 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 19:32:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:14,283 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 19:32:14,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 19:32:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:14,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:14,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:14,289 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:14,289 INFO L82 PathProgramCache]: Analyzing trace with hash -825727688, now seen corresponding path program 95 times [2020-02-10 19:32:14,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:14,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53218134] [2020-02-10 19:32:14,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:14,843 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:14,976 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:14,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53218134] [2020-02-10 19:32:14,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:14,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:14,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027411049] [2020-02-10 19:32:14,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:14,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:14,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:14,986 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:32:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:15,254 INFO L93 Difference]: Finished difference Result 6073 states and 26978 transitions. [2020-02-10 19:32:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:15,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:15,269 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 19:32:15,270 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 19:32:15,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 19:32:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3137. [2020-02-10 19:32:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:32:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15603 transitions. [2020-02-10 19:32:15,486 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15603 transitions. Word has length 31 [2020-02-10 19:32:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:15,487 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15603 transitions. [2020-02-10 19:32:15,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15603 transitions. [2020-02-10 19:32:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:15,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:15,492 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2093184866, now seen corresponding path program 96 times [2020-02-10 19:32:15,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:15,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244847526] [2020-02-10 19:32:15,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:16,062 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:32:16,192 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:16,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244847526] [2020-02-10 19:32:16,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:16,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:16,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471627833] [2020-02-10 19:32:16,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:16,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:16,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:16,204 INFO L87 Difference]: Start difference. First operand 3137 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:32:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:16,536 INFO L93 Difference]: Finished difference Result 6077 states and 26978 transitions. [2020-02-10 19:32:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:16,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:16,551 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 19:32:16,551 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 19:32:16,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 19:32:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3115. [2020-02-10 19:32:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:32:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-02-10 19:32:16,760 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-02-10 19:32:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:16,760 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-02-10 19:32:16,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-02-10 19:32:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:16,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:16,766 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:16,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:16,766 INFO L82 PathProgramCache]: Analyzing trace with hash -192546034, now seen corresponding path program 97 times [2020-02-10 19:32:16,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:16,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242972049] [2020-02-10 19:32:16,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:17,310 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:17,440 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:17,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 19:32:17,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242972049] [2020-02-10 19:32:17,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:17,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:17,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907384963] [2020-02-10 19:32:17,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:17,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:17,450 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-02-10 19:32:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:17,767 INFO L93 Difference]: Finished difference Result 6071 states and 27001 transitions. [2020-02-10 19:32:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:17,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:17,783 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 19:32:17,783 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 19:32:17,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 19:32:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-02-10 19:32:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:32:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-02-10 19:32:17,999 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-02-10 19:32:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:17,999 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-02-10 19:32:17,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-02-10 19:32:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:18,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:18,005 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:18,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1037517486, now seen corresponding path program 98 times [2020-02-10 19:32:18,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:18,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833691682] [2020-02-10 19:32:18,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:18,557 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:32:18,696 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:18,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833691682] [2020-02-10 19:32:18,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:18,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:18,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868027205] [2020-02-10 19:32:18,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:18,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:18,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:18,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:18,707 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-02-10 19:32:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:18,964 INFO L93 Difference]: Finished difference Result 6068 states and 26989 transitions. [2020-02-10 19:32:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:18,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:18,979 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 19:32:18,979 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 19:32:18,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 19:32:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-02-10 19:32:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:32:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15608 transitions. [2020-02-10 19:32:19,189 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15608 transitions. Word has length 31 [2020-02-10 19:32:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:19,190 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15608 transitions. [2020-02-10 19:32:19,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15608 transitions. [2020-02-10 19:32:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:19,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:19,195 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:19,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash -616857270, now seen corresponding path program 99 times [2020-02-10 19:32:19,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:19,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405973522] [2020-02-10 19:32:19,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:19,768 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:19,900 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:19,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405973522] [2020-02-10 19:32:19,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:19,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:19,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446798649] [2020-02-10 19:32:19,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:19,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:19,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:19,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:19,911 INFO L87 Difference]: Start difference. First operand 3129 states and 15608 transitions. Second operand 12 states. [2020-02-10 19:32:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:20,239 INFO L93 Difference]: Finished difference Result 6073 states and 27000 transitions. [2020-02-10 19:32:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:20,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:20,255 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 19:32:20,255 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 19:32:20,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 19:32:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-02-10 19:32:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:32:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15621 transitions. [2020-02-10 19:32:20,478 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15621 transitions. Word has length 31 [2020-02-10 19:32:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:20,478 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15621 transitions. [2020-02-10 19:32:20,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15621 transitions. [2020-02-10 19:32:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:20,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:20,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:20,485 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:20,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:20,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1988167122, now seen corresponding path program 100 times [2020-02-10 19:32:20,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:20,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164464443] [2020-02-10 19:32:20,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:21,039 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:21,216 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:21,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164464443] [2020-02-10 19:32:21,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:21,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:21,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285491209] [2020-02-10 19:32:21,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:21,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:21,227 INFO L87 Difference]: Start difference. First operand 3136 states and 15621 transitions. Second operand 12 states. [2020-02-10 19:32:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:21,588 INFO L93 Difference]: Finished difference Result 6071 states and 26989 transitions. [2020-02-10 19:32:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:21,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:21,603 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 19:32:21,603 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 19:32:21,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 19:32:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-02-10 19:32:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:32:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-02-10 19:32:21,820 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-02-10 19:32:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:21,820 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-02-10 19:32:21,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-02-10 19:32:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:21,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:21,825 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1886139958, now seen corresponding path program 101 times [2020-02-10 19:32:21,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:21,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243591303] [2020-02-10 19:32:21,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:22,364 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:32:22,491 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:22,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243591303] [2020-02-10 19:32:22,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:22,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:22,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312222315] [2020-02-10 19:32:22,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:22,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:22,502 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-02-10 19:32:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:22,727 INFO L93 Difference]: Finished difference Result 6066 states and 26979 transitions. [2020-02-10 19:32:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:22,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:22,742 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 19:32:22,743 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 19:32:22,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 19:32:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3135. [2020-02-10 19:32:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:32:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15613 transitions. [2020-02-10 19:32:22,958 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15613 transitions. Word has length 31 [2020-02-10 19:32:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:22,958 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15613 transitions. [2020-02-10 19:32:22,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15613 transitions. [2020-02-10 19:32:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:22,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:22,963 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1563855886, now seen corresponding path program 102 times [2020-02-10 19:32:22,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:22,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245927329] [2020-02-10 19:32:22,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:23,519 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:23,649 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:23,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245927329] [2020-02-10 19:32:23,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:23,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:23,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696985917] [2020-02-10 19:32:23,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:23,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:23,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:23,660 INFO L87 Difference]: Start difference. First operand 3135 states and 15613 transitions. Second operand 12 states. [2020-02-10 19:32:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:23,895 INFO L93 Difference]: Finished difference Result 6067 states and 26975 transitions. [2020-02-10 19:32:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:23,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:23,910 INFO L225 Difference]: With dead ends: 6067 [2020-02-10 19:32:23,910 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 19:32:23,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 19:32:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3123. [2020-02-10 19:32:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:32:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-02-10 19:32:24,122 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-02-10 19:32:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:24,122 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-02-10 19:32:24,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-02-10 19:32:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:24,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:24,128 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:24,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:24,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1551817972, now seen corresponding path program 103 times [2020-02-10 19:32:24,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:24,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415630890] [2020-02-10 19:32:24,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:24,667 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:24,797 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:24,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415630890] [2020-02-10 19:32:24,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:24,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:24,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872625810] [2020-02-10 19:32:24,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:24,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:24,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:24,808 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:32:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:25,036 INFO L93 Difference]: Finished difference Result 6082 states and 27018 transitions. [2020-02-10 19:32:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:25,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:25,051 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:32:25,051 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 19:32:25,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 19:32:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3137. [2020-02-10 19:32:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:32:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15624 transitions. [2020-02-10 19:32:25,260 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15624 transitions. Word has length 31 [2020-02-10 19:32:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:25,260 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15624 transitions. [2020-02-10 19:32:25,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15624 transitions. [2020-02-10 19:32:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:25,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:25,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:25,266 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 706846520, now seen corresponding path program 104 times [2020-02-10 19:32:25,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:25,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171646267] [2020-02-10 19:32:25,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:25,817 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:32:25,946 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:25,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171646267] [2020-02-10 19:32:25,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:25,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:25,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848047584] [2020-02-10 19:32:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:25,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:25,957 INFO L87 Difference]: Start difference. First operand 3137 states and 15624 transitions. Second operand 12 states. [2020-02-10 19:32:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:26,180 INFO L93 Difference]: Finished difference Result 6079 states and 27006 transitions. [2020-02-10 19:32:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:26,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:26,196 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:32:26,196 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 19:32:26,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 19:32:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3131. [2020-02-10 19:32:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:32:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 19:32:26,410 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 19:32:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:26,411 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 19:32:26,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 19:32:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:26,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:26,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:26,417 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:26,418 INFO L82 PathProgramCache]: Analyzing trace with hash 491039882, now seen corresponding path program 105 times [2020-02-10 19:32:26,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:26,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849451613] [2020-02-10 19:32:26,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:26,982 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:27,115 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:27,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849451613] [2020-02-10 19:32:27,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:27,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:27,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692309367] [2020-02-10 19:32:27,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:27,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:27,125 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:32:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:27,343 INFO L93 Difference]: Finished difference Result 6092 states and 27033 transitions. [2020-02-10 19:32:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:27,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:27,359 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 19:32:27,359 INFO L226 Difference]: Without dead ends: 6072 [2020-02-10 19:32:27,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2020-02-10 19:32:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 3142. [2020-02-10 19:32:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 19:32:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15627 transitions. [2020-02-10 19:32:27,576 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15627 transitions. Word has length 31 [2020-02-10 19:32:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:27,576 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15627 transitions. [2020-02-10 19:32:27,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15627 transitions. [2020-02-10 19:32:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:27,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:27,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:27,581 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1828607096, now seen corresponding path program 106 times [2020-02-10 19:32:27,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:27,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273162528] [2020-02-10 19:32:27,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:28,199 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:32:28,326 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:28,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273162528] [2020-02-10 19:32:28,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:28,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:28,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800255210] [2020-02-10 19:32:28,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:28,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:28,336 INFO L87 Difference]: Start difference. First operand 3142 states and 15627 transitions. Second operand 12 states. [2020-02-10 19:32:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:28,519 INFO L93 Difference]: Finished difference Result 6094 states and 27027 transitions. [2020-02-10 19:32:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:28,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:28,535 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 19:32:28,535 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 19:32:28,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 19:32:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3131. [2020-02-10 19:32:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:32:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15599 transitions. [2020-02-10 19:32:28,751 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15599 transitions. Word has length 31 [2020-02-10 19:32:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:28,751 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15599 transitions. [2020-02-10 19:32:28,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15599 transitions. [2020-02-10 19:32:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:28,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:28,757 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash -778242806, now seen corresponding path program 107 times [2020-02-10 19:32:28,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:28,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865999162] [2020-02-10 19:32:28,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:29,415 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:29,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865999162] [2020-02-10 19:32:29,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:29,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:29,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511277855] [2020-02-10 19:32:29,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:29,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:29,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:29,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:29,426 INFO L87 Difference]: Start difference. First operand 3131 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:32:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:29,645 INFO L93 Difference]: Finished difference Result 6082 states and 27003 transitions. [2020-02-10 19:32:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:29,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:29,660 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:32:29,661 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 19:32:29,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 19:32:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3138. [2020-02-10 19:32:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:32:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-02-10 19:32:29,868 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-02-10 19:32:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:29,868 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-02-10 19:32:29,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-02-10 19:32:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:29,873 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:29,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:29,873 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1404295860, now seen corresponding path program 108 times [2020-02-10 19:32:29,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:29,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047231246] [2020-02-10 19:32:29,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:30,439 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:32:30,564 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:30,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047231246] [2020-02-10 19:32:30,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:30,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:30,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889101269] [2020-02-10 19:32:30,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:30,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:30,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:30,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:30,575 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-02-10 19:32:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:30,761 INFO L93 Difference]: Finished difference Result 6087 states and 27006 transitions. [2020-02-10 19:32:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:30,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:30,776 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 19:32:30,777 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 19:32:30,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 19:32:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3123. [2020-02-10 19:32:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:32:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15577 transitions. [2020-02-10 19:32:30,986 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15577 transitions. Word has length 31 [2020-02-10 19:32:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:30,986 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15577 transitions. [2020-02-10 19:32:30,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15577 transitions. [2020-02-10 19:32:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:30,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:30,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:30,991 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 858760308, now seen corresponding path program 109 times [2020-02-10 19:32:30,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:30,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430005903] [2020-02-10 19:32:30,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:31,534 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:31,664 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:31,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430005903] [2020-02-10 19:32:31,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:31,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:31,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879516293] [2020-02-10 19:32:31,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:31,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:31,674 INFO L87 Difference]: Start difference. First operand 3123 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:32:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:31,913 INFO L93 Difference]: Finished difference Result 6088 states and 27027 transitions. [2020-02-10 19:32:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:31,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:31,929 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 19:32:31,929 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 19:32:31,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 19:32:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3139. [2020-02-10 19:32:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 19:32:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-02-10 19:32:32,144 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-02-10 19:32:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:32,145 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-02-10 19:32:32,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-02-10 19:32:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:32,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:32,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:32,150 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:32,150 INFO L82 PathProgramCache]: Analyzing trace with hash -831182596, now seen corresponding path program 110 times [2020-02-10 19:32:32,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:32,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355256187] [2020-02-10 19:32:32,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:32,709 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:32,841 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:32,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355256187] [2020-02-10 19:32:32,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:32,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:32,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422297383] [2020-02-10 19:32:32,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:32,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:32,852 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-02-10 19:32:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:33,134 INFO L93 Difference]: Finished difference Result 6086 states and 27016 transitions. [2020-02-10 19:32:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:33,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:33,149 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 19:32:33,149 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 19:32:33,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 19:32:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3132. [2020-02-10 19:32:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:32:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15602 transitions. [2020-02-10 19:32:33,364 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15602 transitions. Word has length 31 [2020-02-10 19:32:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:33,364 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15602 transitions. [2020-02-10 19:32:33,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15602 transitions. [2020-02-10 19:32:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:33,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:33,370 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 222293454, now seen corresponding path program 111 times [2020-02-10 19:32:33,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:33,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958303514] [2020-02-10 19:32:33,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:33,944 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:32:34,075 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:34,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958303514] [2020-02-10 19:32:34,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:34,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:34,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844263488] [2020-02-10 19:32:34,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:34,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:34,086 INFO L87 Difference]: Start difference. First operand 3132 states and 15602 transitions. Second operand 12 states. [2020-02-10 19:32:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:34,312 INFO L93 Difference]: Finished difference Result 6096 states and 27036 transitions. [2020-02-10 19:32:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:34,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:34,327 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 19:32:34,327 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 19:32:34,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 19:32:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3143. [2020-02-10 19:32:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:32:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15622 transitions. [2020-02-10 19:32:34,592 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15622 transitions. Word has length 31 [2020-02-10 19:32:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:34,592 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15622 transitions. [2020-02-10 19:32:34,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15622 transitions. [2020-02-10 19:32:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:34,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:34,598 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1559860668, now seen corresponding path program 112 times [2020-02-10 19:32:34,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:34,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579389651] [2020-02-10 19:32:34,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:35,163 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:32:35,289 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:35,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579389651] [2020-02-10 19:32:35,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:35,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:35,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133124984] [2020-02-10 19:32:35,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:35,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:35,300 INFO L87 Difference]: Start difference. First operand 3143 states and 15622 transitions. Second operand 12 states. [2020-02-10 19:32:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:35,490 INFO L93 Difference]: Finished difference Result 6098 states and 27030 transitions. [2020-02-10 19:32:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:35,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:35,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:35,505 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 19:32:35,505 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 19:32:35,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 19:32:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3132. [2020-02-10 19:32:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:32:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15593 transitions. [2020-02-10 19:32:35,716 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15593 transitions. Word has length 31 [2020-02-10 19:32:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:35,716 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15593 transitions. [2020-02-10 19:32:35,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15593 transitions. [2020-02-10 19:32:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:35,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:35,721 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1978695374, now seen corresponding path program 113 times [2020-02-10 19:32:35,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:35,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561143258] [2020-02-10 19:32:35,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:36,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561143258] [2020-02-10 19:32:36,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:36,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:36,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067280921] [2020-02-10 19:32:36,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:36,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:36,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:36,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:36,516 INFO L87 Difference]: Start difference. First operand 3132 states and 15593 transitions. Second operand 12 states. [2020-02-10 19:32:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:36,806 INFO L93 Difference]: Finished difference Result 6089 states and 27012 transitions. [2020-02-10 19:32:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:36,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:36,822 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 19:32:36,822 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 19:32:36,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 19:32:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-02-10 19:32:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:32:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15608 transitions. [2020-02-10 19:32:37,038 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15608 transitions. Word has length 31 [2020-02-10 19:32:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:37,038 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15608 transitions. [2020-02-10 19:32:37,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15608 transitions. [2020-02-10 19:32:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:37,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:37,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:37,043 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash 711238196, now seen corresponding path program 114 times [2020-02-10 19:32:37,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:37,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284324193] [2020-02-10 19:32:37,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:37,602 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:32:37,730 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:37,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284324193] [2020-02-10 19:32:37,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:37,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:37,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567337496] [2020-02-10 19:32:37,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:37,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:37,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:37,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:37,740 INFO L87 Difference]: Start difference. First operand 3140 states and 15608 transitions. Second operand 12 states. [2020-02-10 19:32:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:37,978 INFO L93 Difference]: Finished difference Result 6093 states and 27012 transitions. [2020-02-10 19:32:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:37,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:37,995 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 19:32:37,995 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 19:32:37,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 19:32:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3123. [2020-02-10 19:32:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:32:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15569 transitions. [2020-02-10 19:32:38,212 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15569 transitions. Word has length 31 [2020-02-10 19:32:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:38,212 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15569 transitions. [2020-02-10 19:32:38,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15569 transitions. [2020-02-10 19:32:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:38,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:38,217 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash -679268808, now seen corresponding path program 115 times [2020-02-10 19:32:38,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:38,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641975062] [2020-02-10 19:32:38,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:38,904 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:38,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641975062] [2020-02-10 19:32:38,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:38,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:38,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042793925] [2020-02-10 19:32:38,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:38,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:38,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:38,917 INFO L87 Difference]: Start difference. First operand 3123 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:32:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:39,202 INFO L93 Difference]: Finished difference Result 6071 states and 26979 transitions. [2020-02-10 19:32:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:39,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:39,216 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 19:32:39,216 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 19:32:39,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 19:32:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3136. [2020-02-10 19:32:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:32:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15606 transitions. [2020-02-10 19:32:39,438 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15606 transitions. Word has length 31 [2020-02-10 19:32:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:39,439 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15606 transitions. [2020-02-10 19:32:39,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15606 transitions. [2020-02-10 19:32:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:39,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:39,444 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:39,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1524240260, now seen corresponding path program 116 times [2020-02-10 19:32:39,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:39,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049267281] [2020-02-10 19:32:39,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:40,157 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:40,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049267281] [2020-02-10 19:32:40,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:40,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:40,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139477807] [2020-02-10 19:32:40,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:40,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:40,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:40,169 INFO L87 Difference]: Start difference. First operand 3136 states and 15606 transitions. Second operand 12 states. [2020-02-10 19:32:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:40,394 INFO L93 Difference]: Finished difference Result 6072 states and 26975 transitions. [2020-02-10 19:32:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:40,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:40,410 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 19:32:40,410 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 19:32:40,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 19:32:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3130. [2020-02-10 19:32:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:32:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15589 transitions. [2020-02-10 19:32:40,617 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15589 transitions. Word has length 31 [2020-02-10 19:32:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:40,618 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15589 transitions. [2020-02-10 19:32:40,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15589 transitions. [2020-02-10 19:32:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:40,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:40,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:40,623 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1315735662, now seen corresponding path program 117 times [2020-02-10 19:32:40,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:40,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563943200] [2020-02-10 19:32:40,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:41,177 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:32:41,318 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:41,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563943200] [2020-02-10 19:32:41,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:41,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:41,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256573363] [2020-02-10 19:32:41,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:41,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:41,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:41,329 INFO L87 Difference]: Start difference. First operand 3130 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:32:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:41,642 INFO L93 Difference]: Finished difference Result 6076 states and 26982 transitions. [2020-02-10 19:32:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:41,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:41,697 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 19:32:41,698 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 19:32:41,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 19:32:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3137. [2020-02-10 19:32:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:32:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15602 transitions. [2020-02-10 19:32:41,904 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15602 transitions. Word has length 31 [2020-02-10 19:32:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:41,904 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15602 transitions. [2020-02-10 19:32:41,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15602 transitions. [2020-02-10 19:32:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:41,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:41,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:41,910 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash 866803004, now seen corresponding path program 118 times [2020-02-10 19:32:41,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:41,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60450997] [2020-02-10 19:32:41,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:42,465 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:32:42,596 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:42,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60450997] [2020-02-10 19:32:42,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:42,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:42,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405937586] [2020-02-10 19:32:42,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:42,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:42,607 INFO L87 Difference]: Start difference. First operand 3137 states and 15602 transitions. Second operand 12 states. [2020-02-10 19:32:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:42,814 INFO L93 Difference]: Finished difference Result 6081 states and 26985 transitions. [2020-02-10 19:32:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:42,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:42,829 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 19:32:42,830 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 19:32:42,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 19:32:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-02-10 19:32:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:32:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15582 transitions. [2020-02-10 19:32:43,042 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15582 transitions. Word has length 31 [2020-02-10 19:32:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:43,043 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15582 transitions. [2020-02-10 19:32:43,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15582 transitions. [2020-02-10 19:32:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:43,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:43,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:43,048 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:43,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1709948946, now seen corresponding path program 119 times [2020-02-10 19:32:43,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:43,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997041728] [2020-02-10 19:32:43,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:43,617 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:32:43,748 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:43,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997041728] [2020-02-10 19:32:43,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:43,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:43,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880518527] [2020-02-10 19:32:43,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:43,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:43,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:43,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:43,759 INFO L87 Difference]: Start difference. First operand 3130 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:32:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:44,049 INFO L93 Difference]: Finished difference Result 6079 states and 26982 transitions. [2020-02-10 19:32:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:44,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:44,064 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:32:44,065 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 19:32:44,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 19:32:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-02-10 19:32:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:32:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15597 transitions. [2020-02-10 19:32:44,280 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15597 transitions. Word has length 31 [2020-02-10 19:32:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:44,280 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15597 transitions. [2020-02-10 19:32:44,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15597 transitions. [2020-02-10 19:32:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:44,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:44,286 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash 442491768, now seen corresponding path program 120 times [2020-02-10 19:32:44,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:44,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106566323] [2020-02-10 19:32:44,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:44,850 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:32:44,983 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:44,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106566323] [2020-02-10 19:32:44,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:44,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:44,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381176211] [2020-02-10 19:32:44,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:44,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:44,994 INFO L87 Difference]: Start difference. First operand 3138 states and 15597 transitions. Second operand 12 states. [2020-02-10 19:32:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:45,279 INFO L93 Difference]: Finished difference Result 6083 states and 26982 transitions. [2020-02-10 19:32:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:45,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:45,294 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 19:32:45,294 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 19:32:45,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 19:32:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3104. [2020-02-10 19:32:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 19:32:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15527 transitions. [2020-02-10 19:32:45,504 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15527 transitions. Word has length 31 [2020-02-10 19:32:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:45,504 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15527 transitions. [2020-02-10 19:32:45,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15527 transitions. [2020-02-10 19:32:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:45,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:45,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:45,510 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1165855998, now seen corresponding path program 121 times [2020-02-10 19:32:45,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:45,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224467049] [2020-02-10 19:32:45,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:46,065 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:46,196 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:32:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:46,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224467049] [2020-02-10 19:32:46,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:46,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:46,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587586063] [2020-02-10 19:32:46,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:46,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:46,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:46,208 INFO L87 Difference]: Start difference. First operand 3104 states and 15527 transitions. Second operand 12 states. [2020-02-10 19:32:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:46,546 INFO L93 Difference]: Finished difference Result 6078 states and 27027 transitions. [2020-02-10 19:32:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:46,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:46,561 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 19:32:46,561 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 19:32:46,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 19:32:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3139. [2020-02-10 19:32:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 19:32:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15656 transitions. [2020-02-10 19:32:46,776 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15656 transitions. Word has length 31 [2020-02-10 19:32:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:46,776 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15656 transitions. [2020-02-10 19:32:46,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15656 transitions. [2020-02-10 19:32:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:46,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:46,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:46,782 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash -101601180, now seen corresponding path program 122 times [2020-02-10 19:32:46,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:46,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162082021] [2020-02-10 19:32:46,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:47,468 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:47,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162082021] [2020-02-10 19:32:47,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:47,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:47,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449895494] [2020-02-10 19:32:47,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:47,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:47,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:47,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:47,479 INFO L87 Difference]: Start difference. First operand 3139 states and 15656 transitions. Second operand 12 states. [2020-02-10 19:32:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:47,794 INFO L93 Difference]: Finished difference Result 6079 states and 27021 transitions. [2020-02-10 19:32:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:47,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:47,813 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:32:47,813 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 19:32:47,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 19:32:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3131. [2020-02-10 19:32:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:32:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15634 transitions. [2020-02-10 19:32:48,035 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15634 transitions. Word has length 31 [2020-02-10 19:32:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:48,035 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15634 transitions. [2020-02-10 19:32:48,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15634 transitions. [2020-02-10 19:32:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:48,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:48,041 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:48,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:48,041 INFO L82 PathProgramCache]: Analyzing trace with hash 317233526, now seen corresponding path program 123 times [2020-02-10 19:32:48,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:48,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586093004] [2020-02-10 19:32:48,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:48,586 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:48,763 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:32:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:48,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586093004] [2020-02-10 19:32:48,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:48,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:48,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409955054] [2020-02-10 19:32:48,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:48,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:48,774 INFO L87 Difference]: Start difference. First operand 3131 states and 15634 transitions. Second operand 12 states. [2020-02-10 19:32:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:49,009 INFO L93 Difference]: Finished difference Result 6075 states and 27013 transitions. [2020-02-10 19:32:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:49,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:49,025 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 19:32:49,025 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 19:32:49,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 19:32:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3138. [2020-02-10 19:32:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:32:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-02-10 19:32:49,240 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-02-10 19:32:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:49,240 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-02-10 19:32:49,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-02-10 19:32:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:49,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:49,246 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1654800740, now seen corresponding path program 124 times [2020-02-10 19:32:49,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:49,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932490666] [2020-02-10 19:32:49,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:49,954 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:49,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932490666] [2020-02-10 19:32:49,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:49,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:49,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205233770] [2020-02-10 19:32:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:49,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:49,965 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-02-10 19:32:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:50,244 INFO L93 Difference]: Finished difference Result 6074 states and 27004 transitions. [2020-02-10 19:32:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:50,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:50,259 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 19:32:50,259 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 19:32:50,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 19:32:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3131. [2020-02-10 19:32:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:32:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15627 transitions. [2020-02-10 19:32:50,475 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15627 transitions. Word has length 31 [2020-02-10 19:32:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:50,476 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15627 transitions. [2020-02-10 19:32:50,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15627 transitions. [2020-02-10 19:32:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:50,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:50,481 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:50,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1586690506, now seen corresponding path program 125 times [2020-02-10 19:32:50,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:50,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421176629] [2020-02-10 19:32:50,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:51,025 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:32:51,149 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:32:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:51,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421176629] [2020-02-10 19:32:51,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:51,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:51,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487890787] [2020-02-10 19:32:51,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:51,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:51,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:51,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:51,161 INFO L87 Difference]: Start difference. First operand 3131 states and 15627 transitions. Second operand 12 states. [2020-02-10 19:32:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:51,410 INFO L93 Difference]: Finished difference Result 6077 states and 27010 transitions. [2020-02-10 19:32:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:51,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:51,426 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 19:32:51,426 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 19:32:51,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 19:32:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3138. [2020-02-10 19:32:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:32:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15640 transitions. [2020-02-10 19:32:51,641 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15640 transitions. Word has length 31 [2020-02-10 19:32:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:51,641 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15640 transitions. [2020-02-10 19:32:51,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15640 transitions. [2020-02-10 19:32:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:51,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:51,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:51,648 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1018333886, now seen corresponding path program 126 times [2020-02-10 19:32:51,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:51,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290310945] [2020-02-10 19:32:51,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:52,196 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:32:52,326 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:32:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:52,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290310945] [2020-02-10 19:32:52,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:52,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:52,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15010465] [2020-02-10 19:32:52,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:52,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:52,337 INFO L87 Difference]: Start difference. First operand 3138 states and 15640 transitions. Second operand 12 states. [2020-02-10 19:32:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:52,598 INFO L93 Difference]: Finished difference Result 6075 states and 26999 transitions. [2020-02-10 19:32:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:52,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:52,613 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 19:32:52,613 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 19:32:52,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 19:32:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3124. [2020-02-10 19:32:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:32:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15607 transitions. [2020-02-10 19:32:52,830 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15607 transitions. Word has length 31 [2020-02-10 19:32:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:52,830 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15607 transitions. [2020-02-10 19:32:52,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15607 transitions. [2020-02-10 19:32:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:52,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:52,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:52,836 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1384747292, now seen corresponding path program 127 times [2020-02-10 19:32:52,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:52,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546447434] [2020-02-10 19:32:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:53,401 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:53,530 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:32:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:53,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546447434] [2020-02-10 19:32:53,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:53,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:53,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417104233] [2020-02-10 19:32:53,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:53,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:53,542 INFO L87 Difference]: Start difference. First operand 3124 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:32:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:53,788 INFO L93 Difference]: Finished difference Result 6092 states and 27051 transitions. [2020-02-10 19:32:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:53,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:53,804 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 19:32:53,804 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 19:32:53,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 19:32:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3143. [2020-02-10 19:32:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:32:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15659 transitions. [2020-02-10 19:32:54,019 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15659 transitions. Word has length 31 [2020-02-10 19:32:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:54,019 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15659 transitions. [2020-02-10 19:32:54,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15659 transitions. [2020-02-10 19:32:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:54,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:54,025 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1642762826, now seen corresponding path program 128 times [2020-02-10 19:32:54,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:54,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723303187] [2020-02-10 19:32:54,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:54,600 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:54,733 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:54,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723303187] [2020-02-10 19:32:54,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:54,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:54,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028914346] [2020-02-10 19:32:54,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:54,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:54,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:54,744 INFO L87 Difference]: Start difference. First operand 3143 states and 15659 transitions. Second operand 12 states. [2020-02-10 19:32:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:54,995 INFO L93 Difference]: Finished difference Result 6093 states and 27045 transitions. [2020-02-10 19:32:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:54,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:55,010 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 19:32:55,011 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 19:32:55,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 19:32:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3135. [2020-02-10 19:32:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:32:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15636 transitions. [2020-02-10 19:32:55,220 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15636 transitions. Word has length 31 [2020-02-10 19:32:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:55,220 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15636 transitions. [2020-02-10 19:32:55,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15636 transitions. [2020-02-10 19:32:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:55,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:55,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:55,225 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:55,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1425130678, now seen corresponding path program 129 times [2020-02-10 19:32:55,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:55,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884199867] [2020-02-10 19:32:55,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:55,536 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2020-02-10 19:32:55,860 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:32:55,988 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:32:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:55,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884199867] [2020-02-10 19:32:55,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:55,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:55,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579011977] [2020-02-10 19:32:55,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:55,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:55,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:55,999 INFO L87 Difference]: Start difference. First operand 3135 states and 15636 transitions. Second operand 12 states. [2020-02-10 19:32:56,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:56,271 INFO L93 Difference]: Finished difference Result 6095 states and 27048 transitions. [2020-02-10 19:32:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:56,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:56,286 INFO L225 Difference]: With dead ends: 6095 [2020-02-10 19:32:56,286 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 19:32:56,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 19:32:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3144. [2020-02-10 19:32:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 19:32:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15653 transitions. [2020-02-10 19:32:56,495 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15653 transitions. Word has length 31 [2020-02-10 19:32:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:56,495 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15653 transitions. [2020-02-10 19:32:56,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15653 transitions. [2020-02-10 19:32:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:56,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:56,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:56,500 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1495240714, now seen corresponding path program 130 times [2020-02-10 19:32:56,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:56,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020066626] [2020-02-10 19:32:56,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:57,074 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:32:57,204 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:32:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:57,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020066626] [2020-02-10 19:32:57,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:57,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:57,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639740085] [2020-02-10 19:32:57,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:57,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:57,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:57,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:57,215 INFO L87 Difference]: Start difference. First operand 3144 states and 15653 transitions. Second operand 12 states. [2020-02-10 19:32:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:57,475 INFO L93 Difference]: Finished difference Result 6098 states and 27045 transitions. [2020-02-10 19:32:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:57,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:57,491 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 19:32:57,491 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 19:32:57,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 19:32:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3135. [2020-02-10 19:32:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:32:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15627 transitions. [2020-02-10 19:32:57,706 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15627 transitions. Word has length 31 [2020-02-10 19:32:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:57,707 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15627 transitions. [2020-02-10 19:32:57,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15627 transitions. [2020-02-10 19:32:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:57,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:57,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:57,712 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash -478793354, now seen corresponding path program 131 times [2020-02-10 19:32:57,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:57,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420478817] [2020-02-10 19:32:57,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:58,285 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:32:58,415 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:32:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:58,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420478817] [2020-02-10 19:32:58,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:58,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:58,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040053530] [2020-02-10 19:32:58,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:58,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:58,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:58,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:58,425 INFO L87 Difference]: Start difference. First operand 3135 states and 15627 transitions. Second operand 12 states. [2020-02-10 19:32:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:58,686 INFO L93 Difference]: Finished difference Result 6099 states and 27047 transitions. [2020-02-10 19:32:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:58,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:58,701 INFO L225 Difference]: With dead ends: 6099 [2020-02-10 19:32:58,701 INFO L226 Difference]: Without dead ends: 6079 [2020-02-10 19:32:58,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:32:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2020-02-10 19:32:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 3146. [2020-02-10 19:32:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 19:32:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15647 transitions. [2020-02-10 19:32:58,910 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15647 transitions. Word has length 31 [2020-02-10 19:32:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:32:58,911 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15647 transitions. [2020-02-10 19:32:58,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:32:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15647 transitions. [2020-02-10 19:32:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:32:58,916 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:32:58,916 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:32:58,916 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:32:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:32:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash 858773860, now seen corresponding path program 132 times [2020-02-10 19:32:58,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:32:58,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843025218] [2020-02-10 19:32:58,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:32:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:32:59,487 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:32:59,619 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:32:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:32:59,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843025218] [2020-02-10 19:32:59,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:32:59,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:32:59,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951594995] [2020-02-10 19:32:59,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:32:59,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:32:59,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:32:59,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:32:59,630 INFO L87 Difference]: Start difference. First operand 3146 states and 15647 transitions. Second operand 12 states. [2020-02-10 19:32:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:32:59,866 INFO L93 Difference]: Finished difference Result 6101 states and 27041 transitions. [2020-02-10 19:32:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:32:59,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:32:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:32:59,882 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 19:32:59,883 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 19:32:59,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 19:33:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3124. [2020-02-10 19:33:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:33:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15597 transitions. [2020-02-10 19:33:00,102 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15597 transitions. Word has length 31 [2020-02-10 19:33:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:00,103 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15597 transitions. [2020-02-10 19:33:00,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15597 transitions. [2020-02-10 19:33:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:00,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:00,108 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1524104676, now seen corresponding path program 133 times [2020-02-10 19:33:00,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:00,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661852861] [2020-02-10 19:33:00,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:00,672 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:00,803 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:00,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661852861] [2020-02-10 19:33:00,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:00,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:00,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001371601] [2020-02-10 19:33:00,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:00,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:00,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:00,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:00,813 INFO L87 Difference]: Start difference. First operand 3124 states and 15597 transitions. Second operand 12 states. [2020-02-10 19:33:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:01,069 INFO L93 Difference]: Finished difference Result 6080 states and 27013 transitions. [2020-02-10 19:33:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:01,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:01,085 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 19:33:01,085 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 19:33:01,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 19:33:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3139. [2020-02-10 19:33:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 19:33:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15640 transitions. [2020-02-10 19:33:01,300 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15640 transitions. Word has length 31 [2020-02-10 19:33:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:01,301 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15640 transitions. [2020-02-10 19:33:01,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15640 transitions. [2020-02-10 19:33:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:01,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:01,306 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:01,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1433295406, now seen corresponding path program 134 times [2020-02-10 19:33:01,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:01,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941554413] [2020-02-10 19:33:01,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:01,991 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:02,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941554413] [2020-02-10 19:33:02,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:02,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:02,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444693290] [2020-02-10 19:33:02,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:02,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:02,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:02,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:02,001 INFO L87 Difference]: Start difference. First operand 3139 states and 15640 transitions. Second operand 12 states. [2020-02-10 19:33:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:02,304 INFO L93 Difference]: Finished difference Result 6079 states and 27004 transitions. [2020-02-10 19:33:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:02,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:02,319 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:33:02,320 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 19:33:02,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 19:33:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3132. [2020-02-10 19:33:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:33:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15620 transitions. [2020-02-10 19:33:02,586 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15620 transitions. Word has length 31 [2020-02-10 19:33:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:02,586 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15620 transitions. [2020-02-10 19:33:02,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15620 transitions. [2020-02-10 19:33:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:02,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:02,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:02,592 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:02,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 887637822, now seen corresponding path program 135 times [2020-02-10 19:33:02,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:02,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800269680] [2020-02-10 19:33:02,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:03,150 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:03,282 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:03,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800269680] [2020-02-10 19:33:03,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:03,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:03,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652485511] [2020-02-10 19:33:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:03,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:03,293 INFO L87 Difference]: Start difference. First operand 3132 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:33:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:03,572 INFO L93 Difference]: Finished difference Result 6086 states and 27018 transitions. [2020-02-10 19:33:03,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:03,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:03,586 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 19:33:03,587 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 19:33:03,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 19:33:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3141. [2020-02-10 19:33:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:33:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15637 transitions. [2020-02-10 19:33:03,800 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15637 transitions. Word has length 31 [2020-02-10 19:33:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:03,800 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15637 transitions. [2020-02-10 19:33:03,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15637 transitions. [2020-02-10 19:33:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:03,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:03,806 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash 957747858, now seen corresponding path program 136 times [2020-02-10 19:33:03,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:03,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769552762] [2020-02-10 19:33:03,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:04,369 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:33:04,499 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:04,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769552762] [2020-02-10 19:33:04,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:04,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:04,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852669097] [2020-02-10 19:33:04,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:04,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:04,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:04,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:04,509 INFO L87 Difference]: Start difference. First operand 3141 states and 15637 transitions. Second operand 12 states. [2020-02-10 19:33:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:04,749 INFO L93 Difference]: Finished difference Result 6089 states and 27015 transitions. [2020-02-10 19:33:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:04,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:04,764 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 19:33:04,764 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 19:33:04,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 19:33:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3132. [2020-02-10 19:33:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:33:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15612 transitions. [2020-02-10 19:33:04,978 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15612 transitions. Word has length 31 [2020-02-10 19:33:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:04,979 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15612 transitions. [2020-02-10 19:33:04,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15612 transitions. [2020-02-10 19:33:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:04,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:04,984 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash 740115710, now seen corresponding path program 137 times [2020-02-10 19:33:04,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:04,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108783626] [2020-02-10 19:33:04,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:05,543 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:05,678 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:05,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108783626] [2020-02-10 19:33:05,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:05,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:05,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579734797] [2020-02-10 19:33:05,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:05,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:05,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:05,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:05,688 INFO L87 Difference]: Start difference. First operand 3132 states and 15612 transitions. Second operand 12 states. [2020-02-10 19:33:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:05,983 INFO L93 Difference]: Finished difference Result 6083 states and 27003 transitions. [2020-02-10 19:33:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:05,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:05,998 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 19:33:05,998 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 19:33:05,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 19:33:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3140. [2020-02-10 19:33:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:33:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15627 transitions. [2020-02-10 19:33:06,215 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15627 transitions. Word has length 31 [2020-02-10 19:33:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:06,215 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15627 transitions. [2020-02-10 19:33:06,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15627 transitions. [2020-02-10 19:33:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:06,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:06,221 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:06,221 INFO L82 PathProgramCache]: Analyzing trace with hash -527341468, now seen corresponding path program 138 times [2020-02-10 19:33:06,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:06,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706554291] [2020-02-10 19:33:06,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:06,784 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:33:06,917 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:06,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706554291] [2020-02-10 19:33:06,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:06,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:06,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635280983] [2020-02-10 19:33:06,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:06,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:06,929 INFO L87 Difference]: Start difference. First operand 3140 states and 15627 transitions. Second operand 12 states. [2020-02-10 19:33:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:07,163 INFO L93 Difference]: Finished difference Result 6087 states and 27003 transitions. [2020-02-10 19:33:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:07,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:07,178 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 19:33:07,178 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 19:33:07,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 19:33:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3124. [2020-02-10 19:33:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:33:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 19:33:07,387 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 19:33:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:07,387 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 19:33:07,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 19:33:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:07,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:07,393 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:07,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1364544650, now seen corresponding path program 139 times [2020-02-10 19:33:07,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:07,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217060820] [2020-02-10 19:33:07,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:07,943 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:08,077 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:08,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 19:33:08,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217060820] [2020-02-10 19:33:08,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:08,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:08,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781872337] [2020-02-10 19:33:08,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:08,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:08,088 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:33:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:08,349 INFO L93 Difference]: Finished difference Result 6086 states and 27017 transitions. [2020-02-10 19:33:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:08,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:08,364 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 19:33:08,364 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 19:33:08,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 19:33:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3140. [2020-02-10 19:33:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:33:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15634 transitions. [2020-02-10 19:33:08,580 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15634 transitions. Word has length 31 [2020-02-10 19:33:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:08,580 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15634 transitions. [2020-02-10 19:33:08,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15634 transitions. [2020-02-10 19:33:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:08,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:08,586 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash -325398254, now seen corresponding path program 140 times [2020-02-10 19:33:08,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:08,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253645893] [2020-02-10 19:33:08,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:09,134 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:33:09,269 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:09,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253645893] [2020-02-10 19:33:09,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:09,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:09,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646339054] [2020-02-10 19:33:09,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:09,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:09,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:09,279 INFO L87 Difference]: Start difference. First operand 3140 states and 15634 transitions. Second operand 12 states. [2020-02-10 19:33:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:09,631 INFO L93 Difference]: Finished difference Result 6084 states and 27006 transitions. [2020-02-10 19:33:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:09,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:09,646 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 19:33:09,646 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 19:33:09,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 19:33:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3133. [2020-02-10 19:33:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:33:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15614 transitions. [2020-02-10 19:33:09,912 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15614 transitions. Word has length 31 [2020-02-10 19:33:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:09,912 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15614 transitions. [2020-02-10 19:33:09,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15614 transitions. [2020-02-10 19:33:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:09,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:09,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:09,917 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 728077796, now seen corresponding path program 141 times [2020-02-10 19:33:09,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:09,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367117727] [2020-02-10 19:33:09,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:10,484 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:10,613 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:10,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367117727] [2020-02-10 19:33:10,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:10,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:10,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352958664] [2020-02-10 19:33:10,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:10,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:10,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:10,624 INFO L87 Difference]: Start difference. First operand 3133 states and 15614 transitions. Second operand 12 states. [2020-02-10 19:33:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:10,984 INFO L93 Difference]: Finished difference Result 6094 states and 27026 transitions. [2020-02-10 19:33:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:10,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:10,999 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 19:33:10,999 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 19:33:10,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 19:33:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3144. [2020-02-10 19:33:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 19:33:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15634 transitions. [2020-02-10 19:33:11,208 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15634 transitions. Word has length 31 [2020-02-10 19:33:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:11,208 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15634 transitions. [2020-02-10 19:33:11,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15634 transitions. [2020-02-10 19:33:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:11,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:11,214 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2065645010, now seen corresponding path program 142 times [2020-02-10 19:33:11,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:11,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012480484] [2020-02-10 19:33:11,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:11,788 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:33:11,917 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:33:11,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 19:33:11,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012480484] [2020-02-10 19:33:11,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:11,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:11,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40696869] [2020-02-10 19:33:11,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:11,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:11,927 INFO L87 Difference]: Start difference. First operand 3144 states and 15634 transitions. Second operand 12 states. [2020-02-10 19:33:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:12,172 INFO L93 Difference]: Finished difference Result 6096 states and 27020 transitions. [2020-02-10 19:33:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:12,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:12,187 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 19:33:12,188 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 19:33:12,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 19:33:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3133. [2020-02-10 19:33:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:33:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15605 transitions. [2020-02-10 19:33:12,394 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15605 transitions. Word has length 31 [2020-02-10 19:33:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:12,394 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15605 transitions. [2020-02-10 19:33:12,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15605 transitions. [2020-02-10 19:33:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:12,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:12,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:12,399 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1810487580, now seen corresponding path program 143 times [2020-02-10 19:33:12,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:12,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128176709] [2020-02-10 19:33:12,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:12,957 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:33:13,088 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:33:13,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 19:33:13,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128176709] [2020-02-10 19:33:13,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:13,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:13,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080102074] [2020-02-10 19:33:13,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:13,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:13,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:13,098 INFO L87 Difference]: Start difference. First operand 3133 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:33:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:13,448 INFO L93 Difference]: Finished difference Result 6087 states and 27002 transitions. [2020-02-10 19:33:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:13,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:13,463 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 19:33:13,463 INFO L226 Difference]: Without dead ends: 6069 [2020-02-10 19:33:13,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2020-02-10 19:33:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 3141. [2020-02-10 19:33:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:33:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15620 transitions. [2020-02-10 19:33:13,679 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15620 transitions. Word has length 31 [2020-02-10 19:33:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:13,679 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15620 transitions. [2020-02-10 19:33:13,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15620 transitions. [2020-02-10 19:33:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:13,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:13,685 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1217022538, now seen corresponding path program 144 times [2020-02-10 19:33:13,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:13,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092048757] [2020-02-10 19:33:13,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:14,247 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:33:14,377 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:33:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:14,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092048757] [2020-02-10 19:33:14,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:14,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:14,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773893713] [2020-02-10 19:33:14,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:14,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:14,386 INFO L87 Difference]: Start difference. First operand 3141 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:33:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:14,567 INFO L93 Difference]: Finished difference Result 6091 states and 27002 transitions. [2020-02-10 19:33:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:14,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:14,582 INFO L225 Difference]: With dead ends: 6091 [2020-02-10 19:33:14,582 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 19:33:14,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 19:33:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3113. [2020-02-10 19:33:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 19:33:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15561 transitions. [2020-02-10 19:33:14,791 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15561 transitions. Word has length 31 [2020-02-10 19:33:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:14,791 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15561 transitions. [2020-02-10 19:33:14,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15561 transitions. [2020-02-10 19:33:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:14,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:14,796 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1443947760, now seen corresponding path program 145 times [2020-02-10 19:33:14,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:14,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162118678] [2020-02-10 19:33:14,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:15,350 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:15,484 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:15,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162118678] [2020-02-10 19:33:15,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:15,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:15,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472744408] [2020-02-10 19:33:15,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:15,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:15,495 INFO L87 Difference]: Start difference. First operand 3113 states and 15561 transitions. Second operand 12 states. [2020-02-10 19:33:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:15,721 INFO L93 Difference]: Finished difference Result 6025 states and 26870 transitions. [2020-02-10 19:33:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:15,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:15,736 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 19:33:15,736 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:33:15,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:33:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3128. [2020-02-10 19:33:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:33:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-02-10 19:33:15,951 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-02-10 19:33:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:15,951 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-02-10 19:33:15,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-02-10 19:33:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:15,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:15,956 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1021462034, now seen corresponding path program 146 times [2020-02-10 19:33:15,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:15,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043559845] [2020-02-10 19:33:15,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:16,496 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 19:33:16,628 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:16,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043559845] [2020-02-10 19:33:16,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:16,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:16,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853434208] [2020-02-10 19:33:16,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:16,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:16,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:16,638 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-02-10 19:33:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:16,894 INFO L93 Difference]: Finished difference Result 6022 states and 26859 transitions. [2020-02-10 19:33:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:16,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:16,910 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 19:33:16,910 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:33:16,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:33:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3123. [2020-02-10 19:33:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:33:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15599 transitions. [2020-02-10 19:33:17,119 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15599 transitions. Word has length 31 [2020-02-10 19:33:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:17,119 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15599 transitions. [2020-02-10 19:33:17,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15599 transitions. [2020-02-10 19:33:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:17,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:17,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:17,124 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1019636524, now seen corresponding path program 147 times [2020-02-10 19:33:17,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:17,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531923249] [2020-02-10 19:33:17,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:17,796 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:17,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 19:33:17,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531923249] [2020-02-10 19:33:17,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:17,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:17,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188727190] [2020-02-10 19:33:17,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:17,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:17,807 INFO L87 Difference]: Start difference. First operand 3123 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:33:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:18,027 INFO L93 Difference]: Finished difference Result 6032 states and 26882 transitions. [2020-02-10 19:33:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:18,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:18,043 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 19:33:18,044 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 19:33:18,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 19:33:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3131. [2020-02-10 19:33:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:33:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-02-10 19:33:18,258 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-02-10 19:33:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:18,258 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-02-10 19:33:18,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-02-10 19:33:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:18,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:18,264 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:18,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash -247820654, now seen corresponding path program 148 times [2020-02-10 19:33:18,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:18,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220648002] [2020-02-10 19:33:18,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:18,802 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:18,936 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:18,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 19:33:18,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220648002] [2020-02-10 19:33:18,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:18,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:18,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841937143] [2020-02-10 19:33:18,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:18,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:18,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:18,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:18,947 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-02-10 19:33:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:19,170 INFO L93 Difference]: Finished difference Result 6033 states and 26876 transitions. [2020-02-10 19:33:19,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:19,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:19,186 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 19:33:19,186 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 19:33:19,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 19:33:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3123. [2020-02-10 19:33:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:33:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-02-10 19:33:19,393 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-02-10 19:33:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:19,393 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-02-10 19:33:19,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-02-10 19:33:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:19,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:19,398 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash 384995180, now seen corresponding path program 149 times [2020-02-10 19:33:19,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:19,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616486203] [2020-02-10 19:33:19,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:19,938 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:33:20,068 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:20,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616486203] [2020-02-10 19:33:20,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:20,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:20,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769019489] [2020-02-10 19:33:20,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:20,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:20,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:20,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:20,078 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:33:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:20,363 INFO L93 Difference]: Finished difference Result 6023 states and 26856 transitions. [2020-02-10 19:33:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:20,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:20,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:20,378 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 19:33:20,378 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 19:33:20,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 19:33:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3128. [2020-02-10 19:33:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:33:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15603 transitions. [2020-02-10 19:33:20,587 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15603 transitions. Word has length 31 [2020-02-10 19:33:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:20,587 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15603 transitions. [2020-02-10 19:33:20,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15603 transitions. [2020-02-10 19:33:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:20,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:20,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:20,593 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:20,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:20,593 INFO L82 PathProgramCache]: Analyzing trace with hash -459976272, now seen corresponding path program 150 times [2020-02-10 19:33:20,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:20,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232116114] [2020-02-10 19:33:20,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:21,132 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:21,266 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:21,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232116114] [2020-02-10 19:33:21,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:21,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:21,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000337461] [2020-02-10 19:33:21,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:21,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:21,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:21,277 INFO L87 Difference]: Start difference. First operand 3128 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:33:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:21,513 INFO L93 Difference]: Finished difference Result 6027 states and 26859 transitions. [2020-02-10 19:33:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:21,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:21,528 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 19:33:21,528 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 19:33:21,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 19:33:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3118. [2020-02-10 19:33:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 19:33:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15580 transitions. [2020-02-10 19:33:21,744 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15580 transitions. Word has length 31 [2020-02-10 19:33:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:21,744 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15580 transitions. [2020-02-10 19:33:21,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15580 transitions. [2020-02-10 19:33:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:21,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:21,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:21,749 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:21,749 INFO L82 PathProgramCache]: Analyzing trace with hash 906454904, now seen corresponding path program 151 times [2020-02-10 19:33:21,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:21,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365320368] [2020-02-10 19:33:21,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:22,298 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:22,428 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:22,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365320368] [2020-02-10 19:33:22,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:22,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:22,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212711996] [2020-02-10 19:33:22,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:22,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:22,438 INFO L87 Difference]: Start difference. First operand 3118 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:33:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:22,670 INFO L93 Difference]: Finished difference Result 6022 states and 26858 transitions. [2020-02-10 19:33:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:22,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:22,685 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 19:33:22,686 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 19:33:22,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 19:33:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-02-10 19:33:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:33:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15608 transitions. [2020-02-10 19:33:22,902 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15608 transitions. Word has length 31 [2020-02-10 19:33:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:22,902 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15608 transitions. [2020-02-10 19:33:22,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15608 transitions. [2020-02-10 19:33:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:22,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:22,908 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash 483969178, now seen corresponding path program 152 times [2020-02-10 19:33:22,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:22,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606978811] [2020-02-10 19:33:22,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:23,465 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 19:33:23,599 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:23,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606978811] [2020-02-10 19:33:23,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:23,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:23,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278091580] [2020-02-10 19:33:23,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:23,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:23,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:23,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:23,610 INFO L87 Difference]: Start difference. First operand 3128 states and 15608 transitions. Second operand 12 states. [2020-02-10 19:33:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:23,914 INFO L93 Difference]: Finished difference Result 6019 states and 26847 transitions. [2020-02-10 19:33:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:23,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:23,930 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 19:33:23,931 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:33:23,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:33:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-02-10 19:33:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:33:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-02-10 19:33:24,138 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-02-10 19:33:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:24,138 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-02-10 19:33:24,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-02-10 19:33:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:24,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:24,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:24,144 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash -366478804, now seen corresponding path program 153 times [2020-02-10 19:33:24,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:24,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793023847] [2020-02-10 19:33:24,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:24,674 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:24,804 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:24,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793023847] [2020-02-10 19:33:24,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:24,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:24,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31201328] [2020-02-10 19:33:24,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:24,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:24,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:24,816 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:33:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:25,047 INFO L93 Difference]: Finished difference Result 6026 states and 26863 transitions. [2020-02-10 19:33:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:25,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:25,063 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 19:33:25,063 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 19:33:25,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 19:33:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3130. [2020-02-10 19:33:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:33:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-02-10 19:33:25,278 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-02-10 19:33:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:25,278 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-02-10 19:33:25,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-02-10 19:33:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:25,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:25,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:25,283 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 971088410, now seen corresponding path program 154 times [2020-02-10 19:33:25,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:25,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437997510] [2020-02-10 19:33:25,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:25,824 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:33:25,953 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:25,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 19:33:25,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437997510] [2020-02-10 19:33:25,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:25,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:25,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271677970] [2020-02-10 19:33:25,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:25,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:25,964 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:33:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:26,249 INFO L93 Difference]: Finished difference Result 6025 states and 26854 transitions. [2020-02-10 19:33:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:26,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:26,264 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 19:33:26,264 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 19:33:26,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 19:33:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-02-10 19:33:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:33:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15589 transitions. [2020-02-10 19:33:26,483 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15589 transitions. Word has length 31 [2020-02-10 19:33:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:26,483 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15589 transitions. [2020-02-10 19:33:26,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15589 transitions. [2020-02-10 19:33:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:26,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:26,489 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1001120148, now seen corresponding path program 155 times [2020-02-10 19:33:26,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:26,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931493619] [2020-02-10 19:33:26,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:27,161 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:27,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931493619] [2020-02-10 19:33:27,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:27,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:27,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598109996] [2020-02-10 19:33:27,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:27,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:27,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:27,172 INFO L87 Difference]: Start difference. First operand 3123 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:33:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:27,455 INFO L93 Difference]: Finished difference Result 6018 states and 26840 transitions. [2020-02-10 19:33:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:27,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:27,470 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 19:33:27,470 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 19:33:27,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 19:33:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3128. [2020-02-10 19:33:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:33:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 19:33:27,679 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 19:33:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:27,679 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 19:33:27,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 19:33:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:27,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:27,684 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 758932792, now seen corresponding path program 156 times [2020-02-10 19:33:27,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:27,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69036946] [2020-02-10 19:33:27,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:28,216 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:33:28,346 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:28,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69036946] [2020-02-10 19:33:28,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:28,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:28,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926283866] [2020-02-10 19:33:28,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:28,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:28,357 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:33:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:28,634 INFO L93 Difference]: Finished difference Result 6020 states and 26839 transitions. [2020-02-10 19:33:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:28,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:28,649 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 19:33:28,649 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:33:28,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:33:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3118. [2020-02-10 19:33:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 19:33:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15575 transitions. [2020-02-10 19:33:28,865 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15575 transitions. Word has length 31 [2020-02-10 19:33:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:28,865 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15575 transitions. [2020-02-10 19:33:28,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15575 transitions. [2020-02-10 19:33:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:28,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:28,870 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash 213397240, now seen corresponding path program 157 times [2020-02-10 19:33:28,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:28,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577620166] [2020-02-10 19:33:28,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:29,427 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:29,559 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:29,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577620166] [2020-02-10 19:33:29,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:29,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:29,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635277045] [2020-02-10 19:33:29,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:29,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:29,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:29,569 INFO L87 Difference]: Start difference. First operand 3118 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:33:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:29,804 INFO L93 Difference]: Finished difference Result 6040 states and 26901 transitions. [2020-02-10 19:33:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:29,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:29,820 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 19:33:29,820 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 19:33:29,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 19:33:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3133. [2020-02-10 19:33:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:33:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15617 transitions. [2020-02-10 19:33:30,030 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15617 transitions. Word has length 31 [2020-02-10 19:33:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:30,030 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15617 transitions. [2020-02-10 19:33:30,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15617 transitions. [2020-02-10 19:33:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:30,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:30,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:30,035 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:30,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1054059938, now seen corresponding path program 158 times [2020-02-10 19:33:30,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:30,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853911753] [2020-02-10 19:33:30,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:30,585 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:30,725 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:30,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853911753] [2020-02-10 19:33:30,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:30,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:30,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566821290] [2020-02-10 19:33:30,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:30,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:30,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:30,735 INFO L87 Difference]: Start difference. First operand 3133 states and 15617 transitions. Second operand 12 states. [2020-02-10 19:33:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:30,993 INFO L93 Difference]: Finished difference Result 6041 states and 26895 transitions. [2020-02-10 19:33:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:30,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:31,008 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 19:33:31,008 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 19:33:31,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 19:33:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-02-10 19:33:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:33:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15595 transitions. [2020-02-10 19:33:31,222 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15595 transitions. Word has length 31 [2020-02-10 19:33:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:31,222 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15595 transitions. [2020-02-10 19:33:31,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15595 transitions. [2020-02-10 19:33:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:31,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:31,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:31,230 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:31,230 INFO L82 PathProgramCache]: Analyzing trace with hash -635225232, now seen corresponding path program 159 times [2020-02-10 19:33:31,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:31,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699627573] [2020-02-10 19:33:31,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:31,782 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:31,911 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:31,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699627573] [2020-02-10 19:33:31,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:31,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:31,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527809037] [2020-02-10 19:33:31,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:31,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:31,923 INFO L87 Difference]: Start difference. First operand 3125 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:33:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:32,155 INFO L93 Difference]: Finished difference Result 6037 states and 26887 transitions. [2020-02-10 19:33:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:32,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:32,170 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 19:33:32,170 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 19:33:32,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 19:33:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3132. [2020-02-10 19:33:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:33:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15608 transitions. [2020-02-10 19:33:32,389 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15608 transitions. Word has length 31 [2020-02-10 19:33:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:32,389 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15608 transitions. [2020-02-10 19:33:32,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15608 transitions. [2020-02-10 19:33:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:32,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:32,394 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash 702341982, now seen corresponding path program 160 times [2020-02-10 19:33:32,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:32,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815636622] [2020-02-10 19:33:32,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:32,945 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:33:33,074 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:33,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815636622] [2020-02-10 19:33:33,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:33,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:33,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021788127] [2020-02-10 19:33:33,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:33,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:33,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:33,085 INFO L87 Difference]: Start difference. First operand 3132 states and 15608 transitions. Second operand 12 states. [2020-02-10 19:33:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:33,335 INFO L93 Difference]: Finished difference Result 6036 states and 26878 transitions. [2020-02-10 19:33:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:33,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:33,350 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:33:33,351 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 19:33:33,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 19:33:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-02-10 19:33:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:33:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-02-10 19:33:33,566 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-02-10 19:33:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:33,566 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-02-10 19:33:33,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-02-10 19:33:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:33,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:33,572 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:33,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:33,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1755818032, now seen corresponding path program 161 times [2020-02-10 19:33:33,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:33,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155154228] [2020-02-10 19:33:33,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:34,136 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:34,264 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:34,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155154228] [2020-02-10 19:33:34,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:34,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:34,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569420068] [2020-02-10 19:33:34,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:34,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:34,275 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:33:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:34,544 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-02-10 19:33:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:34,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:34,559 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 19:33:34,560 INFO L226 Difference]: Without dead ends: 6019 [2020-02-10 19:33:34,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2020-02-10 19:33:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 3132. [2020-02-10 19:33:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:33:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 19:33:34,779 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 19:33:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:34,779 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 19:33:34,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 19:33:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:34,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:34,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:34,785 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:34,786 INFO L82 PathProgramCache]: Analyzing trace with hash 65875128, now seen corresponding path program 162 times [2020-02-10 19:33:34,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:34,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899857577] [2020-02-10 19:33:34,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:35,334 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:33:35,462 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:35,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899857577] [2020-02-10 19:33:35,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:35,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:35,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646329951] [2020-02-10 19:33:35,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:35,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:35,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:35,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:35,473 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:33:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:35,832 INFO L93 Difference]: Finished difference Result 6037 states and 26873 transitions. [2020-02-10 19:33:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:35,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:35,846 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 19:33:35,846 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 19:33:35,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 19:33:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3118. [2020-02-10 19:33:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 19:33:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15570 transitions. [2020-02-10 19:33:36,056 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15570 transitions. Word has length 31 [2020-02-10 19:33:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:36,056 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15570 transitions. [2020-02-10 19:33:36,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15570 transitions. [2020-02-10 19:33:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:36,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:36,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:36,061 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:36,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:36,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1591866330, now seen corresponding path program 163 times [2020-02-10 19:33:36,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:36,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988679107] [2020-02-10 19:33:36,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:36,580 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:36,709 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:36,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988679107] [2020-02-10 19:33:36,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:36,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:36,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669909786] [2020-02-10 19:33:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:36,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:36,720 INFO L87 Difference]: Start difference. First operand 3118 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:33:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:37,046 INFO L93 Difference]: Finished difference Result 6021 states and 26846 transitions. [2020-02-10 19:33:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:37,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:37,065 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 19:33:37,065 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 19:33:37,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 19:33:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3128. [2020-02-10 19:33:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:33:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 19:33:37,276 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 19:33:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:37,276 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 19:33:37,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 19:33:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:37,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:37,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:37,282 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:37,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash 746894878, now seen corresponding path program 164 times [2020-02-10 19:33:37,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:37,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748516335] [2020-02-10 19:33:37,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:37,803 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:37,981 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:37,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748516335] [2020-02-10 19:33:37,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:37,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:37,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931401068] [2020-02-10 19:33:37,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:37,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:37,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:37,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:37,989 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:33:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:38,276 INFO L93 Difference]: Finished difference Result 6025 states and 26849 transitions. [2020-02-10 19:33:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:38,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:38,291 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 19:33:38,291 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 19:33:38,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 19:33:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-02-10 19:33:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:33:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15584 transitions. [2020-02-10 19:33:38,500 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15584 transitions. Word has length 31 [2020-02-10 19:33:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:38,500 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15584 transitions. [2020-02-10 19:33:38,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15584 transitions. [2020-02-10 19:33:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:38,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:38,505 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:38,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:38,506 INFO L82 PathProgramCache]: Analyzing trace with hash 743243858, now seen corresponding path program 165 times [2020-02-10 19:33:38,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:38,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222472732] [2020-02-10 19:33:38,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:39,037 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:39,166 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:39,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222472732] [2020-02-10 19:33:39,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:39,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:39,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094576638] [2020-02-10 19:33:39,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:39,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:39,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:39,176 INFO L87 Difference]: Start difference. First operand 3123 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:33:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:39,424 INFO L93 Difference]: Finished difference Result 6019 states and 26837 transitions. [2020-02-10 19:33:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:39,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:39,439 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 19:33:39,440 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 19:33:39,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 19:33:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-02-10 19:33:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:33:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15593 transitions. [2020-02-10 19:33:39,658 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15593 transitions. Word has length 31 [2020-02-10 19:33:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:39,658 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15593 transitions. [2020-02-10 19:33:39,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15593 transitions. [2020-02-10 19:33:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:39,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:39,664 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:39,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1791670498, now seen corresponding path program 166 times [2020-02-10 19:33:39,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:39,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498099490] [2020-02-10 19:33:39,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:40,197 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:33:40,326 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:40,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498099490] [2020-02-10 19:33:40,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:40,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:40,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998925017] [2020-02-10 19:33:40,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:40,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:40,336 INFO L87 Difference]: Start difference. First operand 3128 states and 15593 transitions. Second operand 12 states. [2020-02-10 19:33:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:40,586 INFO L93 Difference]: Finished difference Result 6021 states and 26836 transitions. [2020-02-10 19:33:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:40,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:40,601 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 19:33:40,601 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:33:40,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:33:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-02-10 19:33:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:33:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-02-10 19:33:40,825 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-02-10 19:33:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:40,825 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-02-10 19:33:40,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-02-10 19:33:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:40,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:40,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:40,831 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash -526038830, now seen corresponding path program 167 times [2020-02-10 19:33:40,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:40,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187063110] [2020-02-10 19:33:40,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:41,357 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:41,486 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:41,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187063110] [2020-02-10 19:33:41,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:41,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:41,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584403827] [2020-02-10 19:33:41,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:41,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:41,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:41,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:41,495 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:33:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:41,729 INFO L93 Difference]: Finished difference Result 6029 states and 26854 transitions. [2020-02-10 19:33:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:41,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:41,743 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 19:33:41,743 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 19:33:41,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 19:33:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3130. [2020-02-10 19:33:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:33:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15592 transitions. [2020-02-10 19:33:41,959 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15592 transitions. Word has length 31 [2020-02-10 19:33:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:41,959 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15592 transitions. [2020-02-10 19:33:41,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15592 transitions. [2020-02-10 19:33:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:41,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:41,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:41,965 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2078985562, now seen corresponding path program 168 times [2020-02-10 19:33:41,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:41,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793599673] [2020-02-10 19:33:41,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:42,487 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:33:42,617 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:33:42,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 19:33:42,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793599673] [2020-02-10 19:33:42,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:42,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:42,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381063704] [2020-02-10 19:33:42,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:42,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:42,628 INFO L87 Difference]: Start difference. First operand 3130 states and 15592 transitions. Second operand 12 states. [2020-02-10 19:33:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:42,856 INFO L93 Difference]: Finished difference Result 6027 states and 26843 transitions. [2020-02-10 19:33:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:42,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:42,871 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 19:33:42,871 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:33:42,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:33:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3113. [2020-02-10 19:33:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 19:33:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15556 transitions. [2020-02-10 19:33:43,087 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15556 transitions. Word has length 31 [2020-02-10 19:33:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:43,088 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15556 transitions. [2020-02-10 19:33:43,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15556 transitions. [2020-02-10 19:33:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:43,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:43,093 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -315342902, now seen corresponding path program 169 times [2020-02-10 19:33:43,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:43,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322454730] [2020-02-10 19:33:43,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:43,793 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:43,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322454730] [2020-02-10 19:33:43,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:43,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:43,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744599250] [2020-02-10 19:33:43,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:43,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:43,804 INFO L87 Difference]: Start difference. First operand 3113 states and 15556 transitions. Second operand 12 states. [2020-02-10 19:33:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:44,056 INFO L93 Difference]: Finished difference Result 6046 states and 26915 transitions. [2020-02-10 19:33:44,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:44,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:44,072 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 19:33:44,072 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 19:33:44,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 19:33:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3131. [2020-02-10 19:33:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:33:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15617 transitions. [2020-02-10 19:33:44,290 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15617 transitions. Word has length 31 [2020-02-10 19:33:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:44,290 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15617 transitions. [2020-02-10 19:33:44,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15617 transitions. [2020-02-10 19:33:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:44,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:44,295 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash -737828628, now seen corresponding path program 170 times [2020-02-10 19:33:44,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:44,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698946258] [2020-02-10 19:33:44,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:44,856 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 19:33:44,988 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:44,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698946258] [2020-02-10 19:33:44,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:44,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:44,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909160870] [2020-02-10 19:33:44,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:44,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:44,999 INFO L87 Difference]: Start difference. First operand 3131 states and 15617 transitions. Second operand 12 states. [2020-02-10 19:33:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:45,271 INFO L93 Difference]: Finished difference Result 6043 states and 26904 transitions. [2020-02-10 19:33:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:45,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:45,287 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 19:33:45,287 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 19:33:45,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 19:33:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-02-10 19:33:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:33:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15603 transitions. [2020-02-10 19:33:45,497 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15603 transitions. Word has length 31 [2020-02-10 19:33:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:45,498 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15603 transitions. [2020-02-10 19:33:45,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15603 transitions. [2020-02-10 19:33:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:45,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:45,503 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash -739654138, now seen corresponding path program 171 times [2020-02-10 19:33:45,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:45,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155887476] [2020-02-10 19:33:45,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:46,044 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:46,176 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:46,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155887476] [2020-02-10 19:33:46,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:46,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:46,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410733733] [2020-02-10 19:33:46,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:46,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:46,187 INFO L87 Difference]: Start difference. First operand 3126 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:33:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:46,444 INFO L93 Difference]: Finished difference Result 6053 states and 26927 transitions. [2020-02-10 19:33:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:46,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:46,460 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:33:46,460 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:33:46,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:33:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3134. [2020-02-10 19:33:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:33:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-02-10 19:33:46,671 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-02-10 19:33:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:46,671 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-02-10 19:33:46,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-02-10 19:33:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:46,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:46,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:46,676 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2007111316, now seen corresponding path program 172 times [2020-02-10 19:33:46,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:46,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59960164] [2020-02-10 19:33:46,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:47,232 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:47,365 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:47,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59960164] [2020-02-10 19:33:47,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:47,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:47,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844535606] [2020-02-10 19:33:47,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:47,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:47,376 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-02-10 19:33:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:47,621 INFO L93 Difference]: Finished difference Result 6054 states and 26921 transitions. [2020-02-10 19:33:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:47,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:47,637 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:33:47,637 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:33:47,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:33:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3126. [2020-02-10 19:33:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:33:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15598 transitions. [2020-02-10 19:33:47,854 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15598 transitions. Word has length 31 [2020-02-10 19:33:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:47,854 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15598 transitions. [2020-02-10 19:33:47,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15598 transitions. [2020-02-10 19:33:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:47,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:47,860 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:47,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1374295482, now seen corresponding path program 173 times [2020-02-10 19:33:47,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:47,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800468095] [2020-02-10 19:33:47,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:48,408 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:33:48,541 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:48,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800468095] [2020-02-10 19:33:48,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:48,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:48,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100613049] [2020-02-10 19:33:48,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:48,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:48,552 INFO L87 Difference]: Start difference. First operand 3126 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:33:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:48,789 INFO L93 Difference]: Finished difference Result 6044 states and 26901 transitions. [2020-02-10 19:33:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:48,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:48,805 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 19:33:48,805 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 19:33:48,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 19:33:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3131. [2020-02-10 19:33:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:33:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 19:33:49,014 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 19:33:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:49,015 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 19:33:49,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 19:33:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:49,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:49,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:49,020 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2075700362, now seen corresponding path program 174 times [2020-02-10 19:33:49,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:49,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521233817] [2020-02-10 19:33:49,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:49,572 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:49,705 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:49,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521233817] [2020-02-10 19:33:49,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:49,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:49,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433704048] [2020-02-10 19:33:49,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:49,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:49,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:49,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:49,715 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:33:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:49,960 INFO L93 Difference]: Finished difference Result 6048 states and 26904 transitions. [2020-02-10 19:33:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:49,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:49,974 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 19:33:49,974 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 19:33:49,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 19:33:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3121. [2020-02-10 19:33:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:33:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15584 transitions. [2020-02-10 19:33:50,191 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15584 transitions. Word has length 31 [2020-02-10 19:33:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:50,191 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15584 transitions. [2020-02-10 19:33:50,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15584 transitions. [2020-02-10 19:33:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:50,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:50,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:50,196 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash 891528248, now seen corresponding path program 175 times [2020-02-10 19:33:50,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:50,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541502382] [2020-02-10 19:33:50,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:50,744 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:50,886 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:50,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541502382] [2020-02-10 19:33:50,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:50,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039975664] [2020-02-10 19:33:50,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:50,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:50,897 INFO L87 Difference]: Start difference. First operand 3121 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:33:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:51,133 INFO L93 Difference]: Finished difference Result 6051 states and 26920 transitions. [2020-02-10 19:33:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:51,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:51,148 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:33:51,149 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 19:33:51,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 19:33:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3132. [2020-02-10 19:33:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:33:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15615 transitions. [2020-02-10 19:33:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15615 transitions. Word has length 31 [2020-02-10 19:33:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:51,367 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15615 transitions. [2020-02-10 19:33:51,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15615 transitions. [2020-02-10 19:33:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:51,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:51,372 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash 469042522, now seen corresponding path program 176 times [2020-02-10 19:33:51,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:51,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987214033] [2020-02-10 19:33:51,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:51,944 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:33:52,076 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:52,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987214033] [2020-02-10 19:33:52,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:52,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:52,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706269269] [2020-02-10 19:33:52,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:52,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:52,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:52,086 INFO L87 Difference]: Start difference. First operand 3132 states and 15615 transitions. Second operand 12 states. [2020-02-10 19:33:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:52,380 INFO L93 Difference]: Finished difference Result 6048 states and 26909 transitions. [2020-02-10 19:33:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:52,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:52,396 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 19:33:52,396 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 19:33:52,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 19:33:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3127. [2020-02-10 19:33:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:33:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-02-10 19:33:52,610 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-02-10 19:33:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:52,611 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-02-10 19:33:52,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-02-10 19:33:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:52,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:52,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:52,616 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1017872314, now seen corresponding path program 177 times [2020-02-10 19:33:52,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:52,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785495582] [2020-02-10 19:33:52,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:53,156 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:33:53,290 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:53,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785495582] [2020-02-10 19:33:53,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:53,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:53,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129218881] [2020-02-10 19:33:53,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:53,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:53,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:53,300 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:33:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:53,579 INFO L93 Difference]: Finished difference Result 6061 states and 26937 transitions. [2020-02-10 19:33:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:53,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:53,595 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:33:53,595 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 19:33:53,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 19:33:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3136. [2020-02-10 19:33:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:33:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15618 transitions. [2020-02-10 19:33:53,814 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15618 transitions. Word has length 31 [2020-02-10 19:33:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:53,815 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15618 transitions. [2020-02-10 19:33:53,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15618 transitions. [2020-02-10 19:33:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:53,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:53,820 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -947762278, now seen corresponding path program 178 times [2020-02-10 19:33:53,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:53,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185595444] [2020-02-10 19:33:53,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:54,380 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:33:54,510 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:54,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185595444] [2020-02-10 19:33:54,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:54,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:54,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077222577] [2020-02-10 19:33:54,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:54,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:54,521 INFO L87 Difference]: Start difference. First operand 3136 states and 15618 transitions. Second operand 12 states. [2020-02-10 19:33:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:54,730 INFO L93 Difference]: Finished difference Result 6064 states and 26934 transitions. [2020-02-10 19:33:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:54,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:54,745 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 19:33:54,745 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 19:33:54,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 19:33:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3127. [2020-02-10 19:33:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:33:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-02-10 19:33:54,961 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-02-10 19:33:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:54,961 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-02-10 19:33:54,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-02-10 19:33:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:54,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:54,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:54,966 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1652513658, now seen corresponding path program 179 times [2020-02-10 19:33:54,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:54,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793519972] [2020-02-10 19:33:54,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:55,514 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:33:55,646 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33: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 19:33:55,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793519972] [2020-02-10 19:33:55,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:55,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:55,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832536770] [2020-02-10 19:33:55,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:55,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:55,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:55,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:55,657 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:33:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:55,912 INFO L93 Difference]: Finished difference Result 6052 states and 26910 transitions. [2020-02-10 19:33:55,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:55,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:55,928 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 19:33:55,928 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:33:55,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:33:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-02-10 19:33:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:33:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15606 transitions. [2020-02-10 19:33:56,138 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15606 transitions. Word has length 31 [2020-02-10 19:33:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:56,138 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15606 transitions. [2020-02-10 19:33:56,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15606 transitions. [2020-02-10 19:33:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:56,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:56,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:56,143 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1159917896, now seen corresponding path program 180 times [2020-02-10 19:33:56,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:56,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739910717] [2020-02-10 19:33:56,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:56,698 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:33:56,827 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:33:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:56,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739910717] [2020-02-10 19:33:56,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:56,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:56,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086792915] [2020-02-10 19:33:56,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:56,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:56,838 INFO L87 Difference]: Start difference. First operand 3133 states and 15606 transitions. Second operand 12 states. [2020-02-10 19:33:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:57,102 INFO L93 Difference]: Finished difference Result 6058 states and 26916 transitions. [2020-02-10 19:33:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:57,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:57,116 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 19:33:57,116 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 19:33:57,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 19:33:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3121. [2020-02-10 19:33:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:33:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-02-10 19:33:57,326 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-02-10 19:33:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:57,326 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-02-10 19:33:57,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-02-10 19:33:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:57,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:57,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:57,331 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash 198470584, now seen corresponding path program 181 times [2020-02-10 19:33:57,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:57,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229887315] [2020-02-10 19:33:57,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:57,903 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:58,035 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:33:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:58,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229887315] [2020-02-10 19:33:58,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:58,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:58,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943953601] [2020-02-10 19:33:58,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:58,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:58,046 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:33:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:58,335 INFO L93 Difference]: Finished difference Result 6075 states and 26976 transitions. [2020-02-10 19:33:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:58,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:58,350 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 19:33:58,351 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 19:33:58,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 19:33:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3140. [2020-02-10 19:33:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:33:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15630 transitions. [2020-02-10 19:33:58,561 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15630 transitions. Word has length 31 [2020-02-10 19:33:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:58,561 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15630 transitions. [2020-02-10 19:33:58,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15630 transitions. [2020-02-10 19:33:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:58,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:58,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:58,566 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1068986594, now seen corresponding path program 182 times [2020-02-10 19:33:58,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:58,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169294256] [2020-02-10 19:33:58,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:33:59,137 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:33:59,269 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:33:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:33:59,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169294256] [2020-02-10 19:33:59,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:33:59,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:33:59,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531710391] [2020-02-10 19:33:59,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:33:59,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:33:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:33:59,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:33:59,324 INFO L87 Difference]: Start difference. First operand 3140 states and 15630 transitions. Second operand 12 states. [2020-02-10 19:33:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:33:59,648 INFO L93 Difference]: Finished difference Result 6076 states and 26970 transitions. [2020-02-10 19:33:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:33:59,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:33:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:33:59,662 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 19:33:59,662 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 19:33:59,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:33:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 19:33:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-02-10 19:33:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:33:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15607 transitions. [2020-02-10 19:33:59,871 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15607 transitions. Word has length 31 [2020-02-10 19:33:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:33:59,872 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15607 transitions. [2020-02-10 19:33:59,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:33:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15607 transitions. [2020-02-10 19:33:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:33:59,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:33:59,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:33:59,877 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:33:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:33:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1286618742, now seen corresponding path program 183 times [2020-02-10 19:33:59,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:33:59,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852459477] [2020-02-10 19:33:59,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:33:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:00,449 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:00,582 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:00,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852459477] [2020-02-10 19:34:00,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:00,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:00,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985871168] [2020-02-10 19:34:00,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:00,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:00,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:00,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:00,593 INFO L87 Difference]: Start difference. First operand 3132 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:34:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:00,962 INFO L93 Difference]: Finished difference Result 6078 states and 26973 transitions. [2020-02-10 19:34:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:00,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:00,978 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 19:34:00,978 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 19:34:00,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 19:34:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3141. [2020-02-10 19:34:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:34:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15624 transitions. [2020-02-10 19:34:01,196 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15624 transitions. Word has length 31 [2020-02-10 19:34:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:01,196 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15624 transitions. [2020-02-10 19:34:01,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15624 transitions. [2020-02-10 19:34:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:01,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:01,202 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1216508706, now seen corresponding path program 184 times [2020-02-10 19:34:01,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:01,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912615926] [2020-02-10 19:34:01,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:01,778 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:34:01,907 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:01,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912615926] [2020-02-10 19:34:01,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:01,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:01,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859077275] [2020-02-10 19:34:01,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:01,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:01,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:01,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:01,918 INFO L87 Difference]: Start difference. First operand 3141 states and 15624 transitions. Second operand 12 states. [2020-02-10 19:34:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:02,243 INFO L93 Difference]: Finished difference Result 6081 states and 26970 transitions. [2020-02-10 19:34:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:02,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:02,259 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 19:34:02,259 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 19:34:02,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 19:34:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3132. [2020-02-10 19:34:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:34:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15598 transitions. [2020-02-10 19:34:02,485 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15598 transitions. Word has length 31 [2020-02-10 19:34:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:02,485 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15598 transitions. [2020-02-10 19:34:02,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15598 transitions. [2020-02-10 19:34:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:02,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:02,490 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1104424522, now seen corresponding path program 185 times [2020-02-10 19:34:02,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:02,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860611096] [2020-02-10 19:34:02,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:03,060 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:03,192 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:34:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:03,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860611096] [2020-02-10 19:34:03,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:03,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:03,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639791965] [2020-02-10 19:34:03,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:03,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:03,202 INFO L87 Difference]: Start difference. First operand 3132 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:34:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:03,499 INFO L93 Difference]: Finished difference Result 6082 states and 26972 transitions. [2020-02-10 19:34:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:03,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:03,514 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:34:03,514 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 19:34:03,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 19:34:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3143. [2020-02-10 19:34:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:34:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15618 transitions. [2020-02-10 19:34:03,733 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15618 transitions. Word has length 31 [2020-02-10 19:34:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:03,733 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15618 transitions. [2020-02-10 19:34:03,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15618 transitions. [2020-02-10 19:34:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:03,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:03,738 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1852975560, now seen corresponding path program 186 times [2020-02-10 19:34:03,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:03,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626167238] [2020-02-10 19:34:03,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:04,311 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:34:04,444 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:34:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:04,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626167238] [2020-02-10 19:34:04,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:04,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:04,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078644214] [2020-02-10 19:34:04,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:04,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:04,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:04,455 INFO L87 Difference]: Start difference. First operand 3143 states and 15618 transitions. Second operand 12 states. [2020-02-10 19:34:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:04,653 INFO L93 Difference]: Finished difference Result 6084 states and 26966 transitions. [2020-02-10 19:34:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:04,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:04,667 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 19:34:04,667 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 19:34:04,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 19:34:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3121. [2020-02-10 19:34:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:34:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 19:34:04,876 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 19:34:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:04,876 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 19:34:04,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 19:34:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:04,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:04,881 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:04,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1576939674, now seen corresponding path program 187 times [2020-02-10 19:34:04,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:04,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340757998] [2020-02-10 19:34:04,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:05,428 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:34:05,554 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:34:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:05,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340757998] [2020-02-10 19:34:05,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:05,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:05,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703599436] [2020-02-10 19:34:05,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:05,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:05,565 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:34:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:05,782 INFO L93 Difference]: Finished difference Result 6053 states and 26910 transitions. [2020-02-10 19:34:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:05,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:05,797 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:34:05,797 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 19:34:05,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 19:34:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-02-10 19:34:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:34:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15603 transitions. [2020-02-10 19:34:06,007 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15603 transitions. Word has length 31 [2020-02-10 19:34:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:06,007 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15603 transitions. [2020-02-10 19:34:06,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15603 transitions. [2020-02-10 19:34:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:06,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:06,013 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash 731968222, now seen corresponding path program 188 times [2020-02-10 19:34:06,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:06,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964482691] [2020-02-10 19:34:06,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:06,564 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:06,741 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:34:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:06,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964482691] [2020-02-10 19:34:06,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:06,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:06,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429842493] [2020-02-10 19:34:06,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:06,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:06,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:06,751 INFO L87 Difference]: Start difference. First operand 3133 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:34:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:06,978 INFO L93 Difference]: Finished difference Result 6057 states and 26913 transitions. [2020-02-10 19:34:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:06,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:06,992 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 19:34:06,993 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 19:34:06,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 19:34:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3128. [2020-02-10 19:34:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:34:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-02-10 19:34:07,201 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-02-10 19:34:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:07,201 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-02-10 19:34:07,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-02-10 19:34:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:07,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:07,206 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:07,207 INFO L82 PathProgramCache]: Analyzing trace with hash 91850348, now seen corresponding path program 189 times [2020-02-10 19:34:07,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:07,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890817245] [2020-02-10 19:34:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:07,745 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:34:07,875 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:34:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:07,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890817245] [2020-02-10 19:34:07,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:07,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:07,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741174686] [2020-02-10 19:34:07,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:07,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:07,885 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:34:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:08,101 INFO L93 Difference]: Finished difference Result 6056 states and 26910 transitions. [2020-02-10 19:34:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:08,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:08,116 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:34:08,117 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 19:34:08,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 19:34:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3134. [2020-02-10 19:34:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:34:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15600 transitions. [2020-02-10 19:34:08,327 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15600 transitions. Word has length 31 [2020-02-10 19:34:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:08,327 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15600 transitions. [2020-02-10 19:34:08,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15600 transitions. [2020-02-10 19:34:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:08,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:08,332 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash 584446110, now seen corresponding path program 190 times [2020-02-10 19:34:08,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:08,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941997129] [2020-02-10 19:34:08,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:08,889 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:34:09,020 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:34:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:09,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941997129] [2020-02-10 19:34:09,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:09,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:09,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444364049] [2020-02-10 19:34:09,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:09,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:09,030 INFO L87 Difference]: Start difference. First operand 3134 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:34:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:09,211 INFO L93 Difference]: Finished difference Result 6062 states and 26916 transitions. [2020-02-10 19:34:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:09,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:09,228 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:34:09,228 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:34:09,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:34:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3128. [2020-02-10 19:34:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:34:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 19:34:09,445 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 19:34:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:09,446 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 19:34:09,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 19:34:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:09,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:09,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:09,451 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1177432340, now seen corresponding path program 191 times [2020-02-10 19:34:09,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:09,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56339575] [2020-02-10 19:34:09,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:10,015 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:10,150 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:34:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:10,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56339575] [2020-02-10 19:34:10,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:10,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:10,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009886246] [2020-02-10 19:34:10,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:10,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:10,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:10,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:10,159 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:34:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:10,378 INFO L93 Difference]: Finished difference Result 6069 states and 26933 transitions. [2020-02-10 19:34:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:10,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:10,394 INFO L225 Difference]: With dead ends: 6069 [2020-02-10 19:34:10,394 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 19:34:10,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 19:34:10,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3139. [2020-02-10 19:34:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 19:34:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15603 transitions. [2020-02-10 19:34:10,608 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15603 transitions. Word has length 31 [2020-02-10 19:34:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:10,608 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15603 transitions. [2020-02-10 19:34:10,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15603 transitions. [2020-02-10 19:34:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:10,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:10,613 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 160134874, now seen corresponding path program 192 times [2020-02-10 19:34:10,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:10,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587808749] [2020-02-10 19:34:10,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:11,177 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:34:11,312 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:34:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:11,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587808749] [2020-02-10 19:34:11,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:11,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:11,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613683405] [2020-02-10 19:34:11,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:11,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:11,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:11,322 INFO L87 Difference]: Start difference. First operand 3139 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:34:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:11,559 INFO L93 Difference]: Finished difference Result 6071 states and 26927 transitions. [2020-02-10 19:34:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:11,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:11,575 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 19:34:11,575 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 19:34:11,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 19:34:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3113. [2020-02-10 19:34:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 19:34:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15548 transitions. [2020-02-10 19:34:11,784 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15548 transitions. Word has length 31 [2020-02-10 19:34:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:11,785 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15548 transitions. [2020-02-10 19:34:11,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15548 transitions. [2020-02-10 19:34:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:11,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:11,790 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:11,790 INFO L82 PathProgramCache]: Analyzing trace with hash -335245110, now seen corresponding path program 193 times [2020-02-10 19:34:11,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:11,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635439754] [2020-02-10 19:34:11,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:12,322 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:12,452 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:12,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635439754] [2020-02-10 19:34:12,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:12,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:12,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367141975] [2020-02-10 19:34:12,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:12,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:12,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:12,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:12,463 INFO L87 Difference]: Start difference. First operand 3113 states and 15548 transitions. Second operand 12 states. [2020-02-10 19:34:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:12,690 INFO L93 Difference]: Finished difference Result 6031 states and 26872 transitions. [2020-02-10 19:34:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:12,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:12,705 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 19:34:12,705 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:34:12,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:34:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3129. [2020-02-10 19:34:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:34:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15604 transitions. [2020-02-10 19:34:12,923 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15604 transitions. Word has length 31 [2020-02-10 19:34:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:12,923 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15604 transitions. [2020-02-10 19:34:12,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15604 transitions. [2020-02-10 19:34:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:12,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:12,928 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash -757730836, now seen corresponding path program 194 times [2020-02-10 19:34:12,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:12,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392780906] [2020-02-10 19:34:12,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:13,470 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:34:13,603 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:13,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392780906] [2020-02-10 19:34:13,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:13,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:13,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083304094] [2020-02-10 19:34:13,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:13,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:13,614 INFO L87 Difference]: Start difference. First operand 3129 states and 15604 transitions. Second operand 12 states. [2020-02-10 19:34:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:13,872 INFO L93 Difference]: Finished difference Result 6028 states and 26861 transitions. [2020-02-10 19:34:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:13,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:13,887 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 19:34:13,887 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 19:34:13,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 19:34:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-02-10 19:34:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:34:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15590 transitions. [2020-02-10 19:34:14,103 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15590 transitions. Word has length 31 [2020-02-10 19:34:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:14,104 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15590 transitions. [2020-02-10 19:34:14,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15590 transitions. [2020-02-10 19:34:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:14,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:14,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:14,109 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1608178818, now seen corresponding path program 195 times [2020-02-10 19:34:14,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:14,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399802959] [2020-02-10 19:34:14,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:14,861 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:14,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399802959] [2020-02-10 19:34:14,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:14,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:14,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026659088] [2020-02-10 19:34:14,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:14,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:14,872 INFO L87 Difference]: Start difference. First operand 3124 states and 15590 transitions. Second operand 12 states. [2020-02-10 19:34:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:15,096 INFO L93 Difference]: Finished difference Result 6035 states and 26877 transitions. [2020-02-10 19:34:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:15,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:15,111 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 19:34:15,111 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:34:15,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:15,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:34:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3131. [2020-02-10 19:34:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:34:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15603 transitions. [2020-02-10 19:34:15,324 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15603 transitions. Word has length 31 [2020-02-10 19:34:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:15,324 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15603 transitions. [2020-02-10 19:34:15,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15603 transitions. [2020-02-10 19:34:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:15,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:15,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:15,330 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:15,330 INFO L82 PathProgramCache]: Analyzing trace with hash -270611604, now seen corresponding path program 196 times [2020-02-10 19:34:15,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:15,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875966182] [2020-02-10 19:34:15,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:15,871 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:16,004 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:16,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875966182] [2020-02-10 19:34:16,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:16,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:16,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062629081] [2020-02-10 19:34:16,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:16,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:16,013 INFO L87 Difference]: Start difference. First operand 3131 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:34:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:16,294 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-02-10 19:34:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:16,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:16,309 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 19:34:16,309 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 19:34:16,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 19:34:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3124. [2020-02-10 19:34:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:34:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15585 transitions. [2020-02-10 19:34:16,551 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15585 transitions. Word has length 31 [2020-02-10 19:34:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:16,551 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15585 transitions. [2020-02-10 19:34:16,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15585 transitions. [2020-02-10 19:34:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:16,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:16,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:16,556 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2052147134, now seen corresponding path program 197 times [2020-02-10 19:34:16,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:16,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576512230] [2020-02-10 19:34:16,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:17,100 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:17,240 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:17,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576512230] [2020-02-10 19:34:17,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:17,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:17,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822303598] [2020-02-10 19:34:17,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:17,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:17,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:17,250 INFO L87 Difference]: Start difference. First operand 3124 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:34:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:17,472 INFO L93 Difference]: Finished difference Result 6027 states and 26854 transitions. [2020-02-10 19:34:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:17,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:17,486 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 19:34:17,486 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 19:34:17,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 19:34:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3129. [2020-02-10 19:34:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:34:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-02-10 19:34:17,694 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-02-10 19:34:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:17,694 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-02-10 19:34:17,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-02-10 19:34:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:17,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:17,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:17,700 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash -482767222, now seen corresponding path program 198 times [2020-02-10 19:34:17,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:17,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260443735] [2020-02-10 19:34:17,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:18,357 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:18,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260443735] [2020-02-10 19:34:18,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:18,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:18,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884718141] [2020-02-10 19:34:18,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:18,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:18,368 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:34:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:18,611 INFO L93 Difference]: Finished difference Result 6029 states and 26853 transitions. [2020-02-10 19:34:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:18,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:18,627 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 19:34:18,627 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:34:18,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:34:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-02-10 19:34:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:34:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15571 transitions. [2020-02-10 19:34:18,841 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15571 transitions. Word has length 31 [2020-02-10 19:34:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:18,842 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15571 transitions. [2020-02-10 19:34:18,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15571 transitions. [2020-02-10 19:34:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:18,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:18,847 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:18,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1409118896, now seen corresponding path program 199 times [2020-02-10 19:34:18,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:18,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489041108] [2020-02-10 19:34:18,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:19,368 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:19,500 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:19,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489041108] [2020-02-10 19:34:19,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:19,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:19,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273871543] [2020-02-10 19:34:19,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:19,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:19,510 INFO L87 Difference]: Start difference. First operand 3119 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:34:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:19,730 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-02-10 19:34:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:19,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:19,745 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 19:34:19,745 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 19:34:19,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 19:34:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-02-10 19:34:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:34:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15602 transitions. [2020-02-10 19:34:19,955 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15602 transitions. Word has length 31 [2020-02-10 19:34:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:19,955 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15602 transitions. [2020-02-10 19:34:19,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15602 transitions. [2020-02-10 19:34:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:19,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:19,961 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash 986633170, now seen corresponding path program 200 times [2020-02-10 19:34:19,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:19,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711168145] [2020-02-10 19:34:19,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:20,619 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:20,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711168145] [2020-02-10 19:34:20,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:20,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:20,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313179632] [2020-02-10 19:34:20,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:20,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:20,630 INFO L87 Difference]: Start difference. First operand 3130 states and 15602 transitions. Second operand 12 states. [2020-02-10 19:34:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:20,899 INFO L93 Difference]: Finished difference Result 6036 states and 26873 transitions. [2020-02-10 19:34:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:20,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:20,915 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:34:20,915 INFO L226 Difference]: Without dead ends: 6015 [2020-02-10 19:34:20,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-02-10 19:34:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-02-10 19:34:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:34:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-02-10 19:34:21,123 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-02-10 19:34:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:21,123 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-02-10 19:34:21,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-02-10 19:34:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:21,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:21,128 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash -500281666, now seen corresponding path program 201 times [2020-02-10 19:34:21,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:21,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856486336] [2020-02-10 19:34:21,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:21,676 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:21,806 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:21,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856486336] [2020-02-10 19:34:21,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:21,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:21,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68459424] [2020-02-10 19:34:21,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:21,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:21,816 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:34:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:22,087 INFO L93 Difference]: Finished difference Result 6049 states and 26901 transitions. [2020-02-10 19:34:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:22,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:22,103 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 19:34:22,103 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:34:22,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:34:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3134. [2020-02-10 19:34:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:34:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15605 transitions. [2020-02-10 19:34:22,310 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15605 transitions. Word has length 31 [2020-02-10 19:34:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:22,310 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15605 transitions. [2020-02-10 19:34:22,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15605 transitions. [2020-02-10 19:34:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:22,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:22,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:22,315 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -430171630, now seen corresponding path program 202 times [2020-02-10 19:34:22,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:22,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198601095] [2020-02-10 19:34:22,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:22,867 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:34:22,999 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:23,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198601095] [2020-02-10 19:34:23,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:23,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:23,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741733256] [2020-02-10 19:34:23,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:23,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:23,010 INFO L87 Difference]: Start difference. First operand 3134 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:34:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:23,209 INFO L93 Difference]: Finished difference Result 6052 states and 26898 transitions. [2020-02-10 19:34:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:23,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:23,224 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 19:34:23,224 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 19:34:23,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 19:34:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3125. [2020-02-10 19:34:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:34:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-02-10 19:34:23,431 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-02-10 19:34:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:23,431 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-02-10 19:34:23,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-02-10 19:34:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:23,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:23,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:23,436 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1134923010, now seen corresponding path program 203 times [2020-02-10 19:34:23,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:23,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234455860] [2020-02-10 19:34:23,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:24,101 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:24,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234455860] [2020-02-10 19:34:24,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:24,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:24,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612389720] [2020-02-10 19:34:24,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:24,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:24,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:24,110 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:34:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:24,349 INFO L93 Difference]: Finished difference Result 6040 states and 26874 transitions. [2020-02-10 19:34:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:24,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:24,365 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 19:34:24,365 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 19:34:24,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 19:34:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3131. [2020-02-10 19:34:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:34:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15593 transitions. [2020-02-10 19:34:24,572 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15593 transitions. Word has length 31 [2020-02-10 19:34:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:24,572 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15593 transitions. [2020-02-10 19:34:24,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15593 transitions. [2020-02-10 19:34:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:24,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:24,577 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash -642327248, now seen corresponding path program 204 times [2020-02-10 19:34:24,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:24,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592437241] [2020-02-10 19:34:24,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:25,118 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:34:25,251 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:25,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592437241] [2020-02-10 19:34:25,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:25,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:25,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461542566] [2020-02-10 19:34:25,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:25,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:25,262 INFO L87 Difference]: Start difference. First operand 3131 states and 15593 transitions. Second operand 12 states. [2020-02-10 19:34:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:25,491 INFO L93 Difference]: Finished difference Result 6046 states and 26880 transitions. [2020-02-10 19:34:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:25,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:25,505 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 19:34:25,506 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:34:25,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:34:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3119. [2020-02-10 19:34:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:34:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 19:34:25,720 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 19:34:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:25,721 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 19:34:25,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 19:34:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:25,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:25,726 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash -670054096, now seen corresponding path program 205 times [2020-02-10 19:34:25,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:25,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035050752] [2020-02-10 19:34:25,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:26,268 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:26,400 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:26,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035050752] [2020-02-10 19:34:26,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:26,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:26,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993909037] [2020-02-10 19:34:26,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:26,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:26,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:26,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:26,411 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:34:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:26,697 INFO L93 Difference]: Finished difference Result 6051 states and 26912 transitions. [2020-02-10 19:34:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:26,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:26,712 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:34:26,712 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 19:34:26,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 19:34:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-02-10 19:34:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:34:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15608 transitions. [2020-02-10 19:34:26,934 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15608 transitions. Word has length 31 [2020-02-10 19:34:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:26,935 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15608 transitions. [2020-02-10 19:34:26,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15608 transitions. [2020-02-10 19:34:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:26,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:26,940 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash 667513118, now seen corresponding path program 206 times [2020-02-10 19:34:26,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:26,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508224226] [2020-02-10 19:34:26,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:27,489 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:27,619 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:27,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 19:34:27,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508224226] [2020-02-10 19:34:27,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:27,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:27,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957338597] [2020-02-10 19:34:27,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:27,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:27,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:27,628 INFO L87 Difference]: Start difference. First operand 3134 states and 15608 transitions. Second operand 12 states. [2020-02-10 19:34:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:27,873 INFO L93 Difference]: Finished difference Result 6050 states and 26903 transitions. [2020-02-10 19:34:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:27,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:27,889 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 19:34:27,889 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 19:34:27,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 19:34:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-02-10 19:34:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:34:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-02-10 19:34:28,144 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-02-10 19:34:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:28,145 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-02-10 19:34:28,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-02-10 19:34:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:28,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:28,150 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:28,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1306520950, now seen corresponding path program 207 times [2020-02-10 19:34:28,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:28,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536192941] [2020-02-10 19:34:28,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:28,703 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:28,834 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:28,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536192941] [2020-02-10 19:34:28,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:28,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:28,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254876730] [2020-02-10 19:34:28,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:28,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:28,845 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:34:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:29,094 INFO L93 Difference]: Finished difference Result 6057 states and 26917 transitions. [2020-02-10 19:34:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:29,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:29,109 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 19:34:29,109 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:34:29,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:34:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3136. [2020-02-10 19:34:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:34:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15605 transitions. [2020-02-10 19:34:29,318 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15605 transitions. Word has length 31 [2020-02-10 19:34:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:29,318 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15605 transitions. [2020-02-10 19:34:29,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15605 transitions. [2020-02-10 19:34:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:29,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:29,323 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1236410914, now seen corresponding path program 208 times [2020-02-10 19:34:29,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:29,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974453324] [2020-02-10 19:34:29,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:29,886 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:34:30,014 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:34:30,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 19:34:30,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974453324] [2020-02-10 19:34:30,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:30,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:30,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972110563] [2020-02-10 19:34:30,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:30,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:30,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:30,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:30,025 INFO L87 Difference]: Start difference. First operand 3136 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:34:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:30,238 INFO L93 Difference]: Finished difference Result 6060 states and 26914 transitions. [2020-02-10 19:34:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:30,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:30,254 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 19:34:30,254 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 19:34:30,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 19:34:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-02-10 19:34:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:34:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15580 transitions. [2020-02-10 19:34:30,470 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15580 transitions. Word has length 31 [2020-02-10 19:34:30,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:30,470 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15580 transitions. [2020-02-10 19:34:30,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15580 transitions. [2020-02-10 19:34:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:30,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:30,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:30,475 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1454043062, now seen corresponding path program 209 times [2020-02-10 19:34:30,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:30,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442700667] [2020-02-10 19:34:30,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:31,016 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:31,149 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:31,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442700667] [2020-02-10 19:34:31,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:31,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:31,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131558770] [2020-02-10 19:34:31,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:31,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:31,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:31,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:31,160 INFO L87 Difference]: Start difference. First operand 3127 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:34:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:31,381 INFO L93 Difference]: Finished difference Result 6054 states and 26902 transitions. [2020-02-10 19:34:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:31,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:31,396 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:34:31,397 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:34:31,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:34:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-02-10 19:34:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:34:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15595 transitions. [2020-02-10 19:34:31,614 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15595 transitions. Word has length 31 [2020-02-10 19:34:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:31,615 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15595 transitions. [2020-02-10 19:34:31,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15595 transitions. [2020-02-10 19:34:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:31,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:31,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:31,620 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1573467056, now seen corresponding path program 210 times [2020-02-10 19:34:31,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:31,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805976781] [2020-02-10 19:34:31,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:32,179 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:34:32,312 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:32,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805976781] [2020-02-10 19:34:32,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:32,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:32,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867210711] [2020-02-10 19:34:32,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:32,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:32,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:32,322 INFO L87 Difference]: Start difference. First operand 3135 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:34:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:32,515 INFO L93 Difference]: Finished difference Result 6058 states and 26902 transitions. [2020-02-10 19:34:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:32,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:32,530 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 19:34:32,530 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 19:34:32,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 19:34:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3119. [2020-02-10 19:34:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:34:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15559 transitions. [2020-02-10 19:34:32,746 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15559 transitions. Word has length 31 [2020-02-10 19:34:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:32,746 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15559 transitions. [2020-02-10 19:34:32,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15559 transitions. [2020-02-10 19:34:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:32,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:32,751 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash 708414994, now seen corresponding path program 211 times [2020-02-10 19:34:32,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:32,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935151274] [2020-02-10 19:34:32,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:33,281 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:33,411 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:33,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935151274] [2020-02-10 19:34:33,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:33,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:33,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395788919] [2020-02-10 19:34:33,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:33,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:33,421 INFO L87 Difference]: Start difference. First operand 3119 states and 15559 transitions. Second operand 12 states. [2020-02-10 19:34:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:33,662 INFO L93 Difference]: Finished difference Result 6033 states and 26859 transitions. [2020-02-10 19:34:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:33,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:33,677 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 19:34:33,677 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 19:34:33,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 19:34:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-02-10 19:34:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:34:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15590 transitions. [2020-02-10 19:34:33,892 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15590 transitions. Word has length 31 [2020-02-10 19:34:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:33,893 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15590 transitions. [2020-02-10 19:34:33,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15590 transitions. [2020-02-10 19:34:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:33,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:33,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:33,898 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1826499362, now seen corresponding path program 212 times [2020-02-10 19:34:33,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:33,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021632620] [2020-02-10 19:34:33,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:34,566 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34: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 19:34:34,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021632620] [2020-02-10 19:34:34,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:34,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:34,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961277724] [2020-02-10 19:34:34,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:34,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:34,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:34,577 INFO L87 Difference]: Start difference. First operand 3130 states and 15590 transitions. Second operand 12 states. [2020-02-10 19:34:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:34,833 INFO L93 Difference]: Finished difference Result 6035 states and 26858 transitions. [2020-02-10 19:34:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:34,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:34,849 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 19:34:34,850 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:34:34,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:34:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-02-10 19:34:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:34:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 19:34:35,128 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 19:34:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:35,129 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 19:34:35,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 19:34:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:35,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:35,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:35,134 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash 71948140, now seen corresponding path program 213 times [2020-02-10 19:34:35,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:35,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066018363] [2020-02-10 19:34:35,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:35,656 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:35,787 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:35,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066018363] [2020-02-10 19:34:35,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:35,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:35,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470679736] [2020-02-10 19:34:35,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:35,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:35,797 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:34:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:36,088 INFO L93 Difference]: Finished difference Result 6038 states and 26863 transitions. [2020-02-10 19:34:36,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:36,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:36,103 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 19:34:36,103 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 19:34:36,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 19:34:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-02-10 19:34:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:34:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15587 transitions. [2020-02-10 19:34:36,311 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15587 transitions. Word has length 31 [2020-02-10 19:34:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:36,312 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15587 transitions. [2020-02-10 19:34:36,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15587 transitions. [2020-02-10 19:34:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:36,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:36,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:36,317 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:36,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash 564543902, now seen corresponding path program 214 times [2020-02-10 19:34:36,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:36,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677062938] [2020-02-10 19:34:36,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:36,850 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:34:36,986 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:36,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677062938] [2020-02-10 19:34:36,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:36,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:36,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826048088] [2020-02-10 19:34:36,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:36,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:36,995 INFO L87 Difference]: Start difference. First operand 3131 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:34:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:37,201 INFO L93 Difference]: Finished difference Result 6044 states and 26869 transitions. [2020-02-10 19:34:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:37,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:37,217 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 19:34:37,217 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:34:37,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:34:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-02-10 19:34:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:34:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15570 transitions. [2020-02-10 19:34:37,425 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15570 transitions. Word has length 31 [2020-02-10 19:34:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:37,425 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15570 transitions. [2020-02-10 19:34:37,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15570 transitions. [2020-02-10 19:34:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:37,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:37,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:37,430 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash 559067372, now seen corresponding path program 215 times [2020-02-10 19:34:37,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:37,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627233951] [2020-02-10 19:34:37,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:37,975 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:38,105 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:38,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627233951] [2020-02-10 19:34:38,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:38,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:38,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458518406] [2020-02-10 19:34:38,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:38,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:38,115 INFO L87 Difference]: Start difference. First operand 3125 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:34:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:38,368 INFO L93 Difference]: Finished difference Result 6044 states and 26871 transitions. [2020-02-10 19:34:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:38,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:38,382 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 19:34:38,382 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:34:38,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:34:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3133. [2020-02-10 19:34:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:34:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-02-10 19:34:38,597 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-02-10 19:34:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:38,597 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-02-10 19:34:38,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-02-10 19:34:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:38,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:38,602 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:38,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:38,603 INFO L82 PathProgramCache]: Analyzing trace with hash -708389806, now seen corresponding path program 216 times [2020-02-10 19:34:38,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:38,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356444590] [2020-02-10 19:34:38,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:39,147 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:34:39,276 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:39,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356444590] [2020-02-10 19:34:39,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:39,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:39,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501915528] [2020-02-10 19:34:39,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:39,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:39,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:39,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:39,285 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:34:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:39,538 INFO L93 Difference]: Finished difference Result 6048 states and 26871 transitions. [2020-02-10 19:34:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:39,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:39,553 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 19:34:39,553 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:34:39,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:34:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3113. [2020-02-10 19:34:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 19:34:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15542 transitions. [2020-02-10 19:34:39,761 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15542 transitions. Word has length 31 [2020-02-10 19:34:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:39,761 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15542 transitions. [2020-02-10 19:34:39,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15542 transitions. [2020-02-10 19:34:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:39,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:39,766 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1409124346, now seen corresponding path program 217 times [2020-02-10 19:34:39,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:39,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868289394] [2020-02-10 19:34:39,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:40,290 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:40,421 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:40,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868289394] [2020-02-10 19:34:40,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:40,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:40,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226512792] [2020-02-10 19:34:40,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:40,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:40,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:40,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:40,431 INFO L87 Difference]: Start difference. First operand 3113 states and 15542 transitions. Second operand 12 states. [2020-02-10 19:34:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:40,722 INFO L93 Difference]: Finished difference Result 6036 states and 26877 transitions. [2020-02-10 19:34:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:40,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:40,737 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:34:40,737 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 19:34:40,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 19:34:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-02-10 19:34:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:34:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15601 transitions. [2020-02-10 19:34:40,945 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15601 transitions. Word has length 31 [2020-02-10 19:34:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:40,945 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15601 transitions. [2020-02-10 19:34:40,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15601 transitions. [2020-02-10 19:34:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:40,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:40,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:40,951 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2040871498, now seen corresponding path program 218 times [2020-02-10 19:34:40,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:40,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926213243] [2020-02-10 19:34:40,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:41,478 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:41,606 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:41,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926213243] [2020-02-10 19:34:41,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:41,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:41,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586161385] [2020-02-10 19:34:41,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:41,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:41,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:41,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:41,616 INFO L87 Difference]: Start difference. First operand 3130 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:34:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:41,879 INFO L93 Difference]: Finished difference Result 6040 states and 26880 transitions. [2020-02-10 19:34:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:41,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:41,895 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 19:34:41,895 INFO L226 Difference]: Without dead ends: 6015 [2020-02-10 19:34:41,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-02-10 19:34:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-02-10 19:34:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:34:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15587 transitions. [2020-02-10 19:34:42,110 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15587 transitions. Word has length 31 [2020-02-10 19:34:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:42,110 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15587 transitions. [2020-02-10 19:34:42,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15587 transitions. [2020-02-10 19:34:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:42,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:42,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:42,116 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2037220478, now seen corresponding path program 219 times [2020-02-10 19:34:42,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:42,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678759840] [2020-02-10 19:34:42,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:42,695 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:42,827 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:42,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678759840] [2020-02-10 19:34:42,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:42,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:42,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443091606] [2020-02-10 19:34:42,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:42,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:42,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:42,838 INFO L87 Difference]: Start difference. First operand 3125 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:34:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:43,098 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-02-10 19:34:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:43,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:43,114 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 19:34:43,114 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 19:34:43,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 19:34:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-02-10 19:34:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:34:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15596 transitions. [2020-02-10 19:34:43,323 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15596 transitions. Word has length 31 [2020-02-10 19:34:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:43,323 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15596 transitions. [2020-02-10 19:34:43,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15596 transitions. [2020-02-10 19:34:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:43,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:43,329 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash -497693878, now seen corresponding path program 220 times [2020-02-10 19:34:43,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:43,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910567498] [2020-02-10 19:34:43,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:43,854 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:34:43,985 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:43,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910567498] [2020-02-10 19:34:43,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:43,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:43,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827598471] [2020-02-10 19:34:43,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:43,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:43,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:43,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:43,994 INFO L87 Difference]: Start difference. First operand 3130 states and 15596 transitions. Second operand 12 states. [2020-02-10 19:34:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:44,223 INFO L93 Difference]: Finished difference Result 6036 states and 26867 transitions. [2020-02-10 19:34:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:44,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:44,239 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:34:44,239 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 19:34:44,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 19:34:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-02-10 19:34:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:34:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-02-10 19:34:44,447 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-02-10 19:34:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:44,447 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-02-10 19:34:44,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-02-10 19:34:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:44,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:44,453 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash 767937790, now seen corresponding path program 221 times [2020-02-10 19:34:44,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:44,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27031192] [2020-02-10 19:34:44,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:44,986 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:45,117 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:45,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27031192] [2020-02-10 19:34:45,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:45,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:45,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029179987] [2020-02-10 19:34:45,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:45,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:45,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:45,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:45,127 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:34:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:45,385 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-02-10 19:34:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:45,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:45,401 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 19:34:45,401 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 19:34:45,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 19:34:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3132. [2020-02-10 19:34:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:34:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15595 transitions. [2020-02-10 19:34:45,609 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15595 transitions. Word has length 31 [2020-02-10 19:34:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:45,610 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15595 transitions. [2020-02-10 19:34:45,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15595 transitions. [2020-02-10 19:34:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:45,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:45,615 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash -922005114, now seen corresponding path program 222 times [2020-02-10 19:34:45,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:45,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343106993] [2020-02-10 19:34:45,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:46,150 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:34:46,278 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:46,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343106993] [2020-02-10 19:34:46,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:46,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:46,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692166266] [2020-02-10 19:34:46,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:46,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:46,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:46,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:46,289 INFO L87 Difference]: Start difference. First operand 3132 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:34:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:46,527 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-02-10 19:34:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:46,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:46,542 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 19:34:46,542 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:34:46,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:34:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3120. [2020-02-10 19:34:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:34:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-02-10 19:34:46,750 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-02-10 19:34:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:46,751 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-02-10 19:34:46,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-02-10 19:34:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:46,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:46,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:46,756 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 335239660, now seen corresponding path program 223 times [2020-02-10 19:34:46,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:46,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372228708] [2020-02-10 19:34:46,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:47,293 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:34:47,422 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:47,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 19:34:47,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372228708] [2020-02-10 19:34:47,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:47,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:47,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556309509] [2020-02-10 19:34:47,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:47,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:47,433 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:34:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:47,738 INFO L93 Difference]: Finished difference Result 6047 states and 26895 transitions. [2020-02-10 19:34:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:47,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:47,755 INFO L225 Difference]: With dead ends: 6047 [2020-02-10 19:34:47,756 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 19:34:47,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 19:34:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3132. [2020-02-10 19:34:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:34:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 19:34:47,972 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 19:34:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:47,972 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 19:34:47,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 19:34:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:47,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:47,978 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash -509731792, now seen corresponding path program 224 times [2020-02-10 19:34:47,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:47,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754076351] [2020-02-10 19:34:47,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:48,505 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:48,635 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:48,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 19:34:48,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754076351] [2020-02-10 19:34:48,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:48,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:48,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687896823] [2020-02-10 19:34:48,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:48,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:48,646 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:34:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:48,999 INFO L93 Difference]: Finished difference Result 6051 states and 26898 transitions. [2020-02-10 19:34:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:48,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:49,014 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:34:49,015 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:34:49,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:34:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3127. [2020-02-10 19:34:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:34:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 19:34:49,223 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 19:34:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:49,224 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 19:34:49,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 19:34:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:49,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:49,230 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:49,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1149849666, now seen corresponding path program 225 times [2020-02-10 19:34:49,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:49,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439123175] [2020-02-10 19:34:49,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:49,683 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 27 [2020-02-10 19:34:49,810 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:49,940 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:49,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439123175] [2020-02-10 19:34:49,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:49,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:49,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480078499] [2020-02-10 19:34:49,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:49,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:49,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:49,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:49,950 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:34:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:50,304 INFO L93 Difference]: Finished difference Result 6050 states and 26895 transitions. [2020-02-10 19:34:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:50,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:50,320 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 19:34:50,320 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:34:50,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:34:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 19:34:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:34:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-02-10 19:34:50,536 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-02-10 19:34:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:50,536 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-02-10 19:34:50,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-02-10 19:34:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:50,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:50,541 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:50,542 INFO L82 PathProgramCache]: Analyzing trace with hash -657253904, now seen corresponding path program 226 times [2020-02-10 19:34:50,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:50,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067134228] [2020-02-10 19:34:50,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:51,068 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:34:51,195 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:51,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067134228] [2020-02-10 19:34:51,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:51,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:51,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635887871] [2020-02-10 19:34:51,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:51,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:51,205 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:34:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:51,523 INFO L93 Difference]: Finished difference Result 6056 states and 26901 transitions. [2020-02-10 19:34:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:51,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:51,538 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:34:51,538 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 19:34:51,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 19:34:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 19:34:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:34:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 19:34:51,746 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 19:34:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:51,747 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 19:34:51,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 19:34:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:51,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:51,752 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1875834942, now seen corresponding path program 227 times [2020-02-10 19:34:51,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:51,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733083818] [2020-02-10 19:34:51,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:52,287 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:52,418 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:34:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:52,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733083818] [2020-02-10 19:34:52,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:52,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:52,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334989925] [2020-02-10 19:34:52,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:52,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:52,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:52,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:52,428 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 19:34:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:52,781 INFO L93 Difference]: Finished difference Result 6063 states and 26918 transitions. [2020-02-10 19:34:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:52,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:52,796 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 19:34:52,796 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 19:34:52,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 19:34:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3138. [2020-02-10 19:34:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:34:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15601 transitions. [2020-02-10 19:34:53,011 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15601 transitions. Word has length 31 [2020-02-10 19:34:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:53,011 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15601 transitions. [2020-02-10 19:34:53,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15601 transitions. [2020-02-10 19:34:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:53,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:53,017 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1081565140, now seen corresponding path program 228 times [2020-02-10 19:34:53,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:53,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831420168] [2020-02-10 19:34:53,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:53,572 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:34:53,704 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:53,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831420168] [2020-02-10 19:34:53,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:53,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:53,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531488579] [2020-02-10 19:34:53,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:53,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:53,715 INFO L87 Difference]: Start difference. First operand 3138 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:34:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:54,035 INFO L93 Difference]: Finished difference Result 6065 states and 26912 transitions. [2020-02-10 19:34:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:54,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:54,051 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 19:34:54,051 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 19:34:54,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 19:34:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3120. [2020-02-10 19:34:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:34:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15561 transitions. [2020-02-10 19:34:54,267 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15561 transitions. Word has length 31 [2020-02-10 19:34:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:54,267 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15561 transitions. [2020-02-10 19:34:54,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15561 transitions. [2020-02-10 19:34:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:54,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:54,272 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1050875668, now seen corresponding path program 229 times [2020-02-10 19:34:54,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:54,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823210766] [2020-02-10 19:34:54,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:54,947 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:54,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823210766] [2020-02-10 19:34:54,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:54,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:54,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129315248] [2020-02-10 19:34:54,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:54,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:54,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:54,956 INFO L87 Difference]: Start difference. First operand 3120 states and 15561 transitions. Second operand 12 states. [2020-02-10 19:34:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:55,178 INFO L93 Difference]: Finished difference Result 6039 states and 26871 transitions. [2020-02-10 19:34:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:55,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:55,192 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 19:34:55,192 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 19:34:55,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 19:34:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3131. [2020-02-10 19:34:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:34:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15592 transitions. [2020-02-10 19:34:55,401 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15592 transitions. Word has length 31 [2020-02-10 19:34:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:55,401 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15592 transitions. [2020-02-10 19:34:55,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15592 transitions. [2020-02-10 19:34:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:55,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:55,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:55,406 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash 709177272, now seen corresponding path program 230 times [2020-02-10 19:34:55,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:55,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663690220] [2020-02-10 19:34:55,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:55,934 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:34:56,064 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:56,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663690220] [2020-02-10 19:34:56,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:56,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:56,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922995531] [2020-02-10 19:34:56,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:56,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:56,075 INFO L87 Difference]: Start difference. First operand 3131 states and 15592 transitions. Second operand 12 states. [2020-02-10 19:34:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:56,316 INFO L93 Difference]: Finished difference Result 6041 states and 26870 transitions. [2020-02-10 19:34:56,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:56,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:56,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:56,332 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 19:34:56,332 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 19:34:56,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 19:34:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3126. [2020-02-10 19:34:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:34:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15578 transitions. [2020-02-10 19:34:56,542 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15578 transitions. Word has length 31 [2020-02-10 19:34:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:56,542 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15578 transitions. [2020-02-10 19:34:56,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15578 transitions. [2020-02-10 19:34:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:56,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:56,547 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1687342522, now seen corresponding path program 231 times [2020-02-10 19:34:56,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:56,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109967865] [2020-02-10 19:34:56,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:57,082 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:34:57,256 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:57,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109967865] [2020-02-10 19:34:57,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:57,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:57,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179519730] [2020-02-10 19:34:57,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:57,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:57,265 INFO L87 Difference]: Start difference. First operand 3126 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:34:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:57,486 INFO L93 Difference]: Finished difference Result 6044 states and 26875 transitions. [2020-02-10 19:34:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:57,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:57,500 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 19:34:57,500 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 19:34:57,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 19:34:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3132. [2020-02-10 19:34:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:34:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15589 transitions. [2020-02-10 19:34:57,718 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15589 transitions. Word has length 31 [2020-02-10 19:34:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:57,718 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15589 transitions. [2020-02-10 19:34:57,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15589 transitions. [2020-02-10 19:34:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:57,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:57,724 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:57,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1194746760, now seen corresponding path program 232 times [2020-02-10 19:34:57,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:57,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118372922] [2020-02-10 19:34:57,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:58,261 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:34:58,393 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:58,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118372922] [2020-02-10 19:34:58,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:58,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:58,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859749787] [2020-02-10 19:34:58,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:58,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:58,403 INFO L87 Difference]: Start difference. First operand 3132 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:34:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:58,586 INFO L93 Difference]: Finished difference Result 6050 states and 26881 transitions. [2020-02-10 19:34:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:58,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:58,602 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 19:34:58,602 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 19:34:58,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 19:34:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-02-10 19:34:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:34:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 19:34:58,810 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 19:34:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:58,811 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 19:34:58,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 19:34:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:58,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:58,816 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1200223290, now seen corresponding path program 233 times [2020-02-10 19:34:58,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:58,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831684357] [2020-02-10 19:34:58,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:34:59,350 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:34:59,481 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:34:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:34:59,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831684357] [2020-02-10 19:34:59,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:34:59,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:34:59,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914945499] [2020-02-10 19:34:59,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:34:59,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:34:59,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:34:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:34:59,491 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:34:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:34:59,707 INFO L93 Difference]: Finished difference Result 6050 states and 26883 transitions. [2020-02-10 19:34:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:34:59,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:34:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:34:59,722 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 19:34:59,722 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 19:34:59,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:34:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 19:34:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-02-10 19:34:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:34:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15587 transitions. [2020-02-10 19:34:59,937 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15587 transitions. Word has length 31 [2020-02-10 19:34:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:34:59,937 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15587 transitions. [2020-02-10 19:34:59,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:34:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15587 transitions. [2020-02-10 19:34:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:34:59,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:34:59,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:34:59,942 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:34:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:34:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1827286828, now seen corresponding path program 234 times [2020-02-10 19:34:59,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:34:59,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26229539] [2020-02-10 19:34:59,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:34:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:00,482 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:35:00,610 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:35:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:00,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26229539] [2020-02-10 19:35:00,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:00,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:00,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602292111] [2020-02-10 19:35:00,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:00,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:00,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:00,621 INFO L87 Difference]: Start difference. First operand 3134 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:35:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:00,834 INFO L93 Difference]: Finished difference Result 6054 states and 26883 transitions. [2020-02-10 19:35:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:00,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:00,849 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:35:00,849 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 19:35:00,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 19:35:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3120. [2020-02-10 19:35:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:35:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15555 transitions. [2020-02-10 19:35:01,058 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15555 transitions. Word has length 31 [2020-02-10 19:35:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:01,058 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15555 transitions. [2020-02-10 19:35:01,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15555 transitions. [2020-02-10 19:35:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:01,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:01,063 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:01,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1706062512, now seen corresponding path program 235 times [2020-02-10 19:35:01,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:01,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949476021] [2020-02-10 19:35:01,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:01,599 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:01,729 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:35:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:01,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949476021] [2020-02-10 19:35:01,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:01,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:01,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569063480] [2020-02-10 19:35:01,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:01,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:01,739 INFO L87 Difference]: Start difference. First operand 3120 states and 15555 transitions. Second operand 12 states. [2020-02-10 19:35:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:01,967 INFO L93 Difference]: Finished difference Result 6063 states and 26924 transitions. [2020-02-10 19:35:01,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:01,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:01,983 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 19:35:01,983 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 19:35:01,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 19:35:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3136. [2020-02-10 19:35:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:35:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15600 transitions. [2020-02-10 19:35:02,201 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15600 transitions. Word has length 31 [2020-02-10 19:35:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:02,201 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15600 transitions. [2020-02-10 19:35:02,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15600 transitions. [2020-02-10 19:35:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:02,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:02,206 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 16119608, now seen corresponding path program 236 times [2020-02-10 19:35:02,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:02,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061769229] [2020-02-10 19:35:02,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:02,751 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:35:02,879 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:35:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:02,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061769229] [2020-02-10 19:35:02,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:02,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:02,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096344615] [2020-02-10 19:35:02,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:02,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:02,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:02,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:02,888 INFO L87 Difference]: Start difference. First operand 3136 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:35:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:03,131 INFO L93 Difference]: Finished difference Result 6061 states and 26913 transitions. [2020-02-10 19:35:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:03,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:03,146 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:35:03,146 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:35:03,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:35:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3129. [2020-02-10 19:35:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:35:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15580 transitions. [2020-02-10 19:35:03,356 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15580 transitions. Word has length 31 [2020-02-10 19:35:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:03,356 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15580 transitions. [2020-02-10 19:35:03,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15580 transitions. [2020-02-10 19:35:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:03,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:03,361 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:03,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1069595658, now seen corresponding path program 237 times [2020-02-10 19:35:03,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:03,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722005708] [2020-02-10 19:35:03,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:03,915 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:04,046 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:35:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:04,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722005708] [2020-02-10 19:35:04,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:04,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:04,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120564114] [2020-02-10 19:35:04,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:04,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:04,055 INFO L87 Difference]: Start difference. First operand 3129 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:35:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:04,342 INFO L93 Difference]: Finished difference Result 6071 states and 26933 transitions. [2020-02-10 19:35:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:04,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:04,403 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 19:35:04,403 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 19:35:04,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 19:35:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-02-10 19:35:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:35:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15600 transitions. [2020-02-10 19:35:04,655 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15600 transitions. Word has length 31 [2020-02-10 19:35:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:04,655 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15600 transitions. [2020-02-10 19:35:04,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15600 transitions. [2020-02-10 19:35:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:04,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:04,662 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1887804424, now seen corresponding path program 238 times [2020-02-10 19:35:04,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:04,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923426242] [2020-02-10 19:35:04,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:05,226 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:35:05,355 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:35:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:05,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923426242] [2020-02-10 19:35:05,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:05,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:05,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989583630] [2020-02-10 19:35:05,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:05,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:05,365 INFO L87 Difference]: Start difference. First operand 3140 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:35:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:05,575 INFO L93 Difference]: Finished difference Result 6073 states and 26927 transitions. [2020-02-10 19:35:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:05,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:05,591 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 19:35:05,591 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 19:35:05,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 19:35:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-02-10 19:35:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:35:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15571 transitions. [2020-02-10 19:35:05,828 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15571 transitions. Word has length 31 [2020-02-10 19:35:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:05,828 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15571 transitions. [2020-02-10 19:35:05,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15571 transitions. [2020-02-10 19:35:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:05,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:05,834 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1468969718, now seen corresponding path program 239 times [2020-02-10 19:35:05,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:05,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707681748] [2020-02-10 19:35:05,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:06,506 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:35:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:06,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707681748] [2020-02-10 19:35:06,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:06,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:06,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587854446] [2020-02-10 19:35:06,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:06,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:06,515 INFO L87 Difference]: Start difference. First operand 3129 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:35:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:06,745 INFO L93 Difference]: Finished difference Result 6064 states and 26909 transitions. [2020-02-10 19:35:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:06,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:06,760 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 19:35:06,760 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 19:35:06,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 19:35:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3137. [2020-02-10 19:35:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:35:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-02-10 19:35:06,974 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-02-10 19:35:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:06,975 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-02-10 19:35:06,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-02-10 19:35:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:06,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:06,980 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1558540400, now seen corresponding path program 240 times [2020-02-10 19:35:06,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:06,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836155966] [2020-02-10 19:35:06,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:07,535 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 19:35:07,666 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 19:35:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:07,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836155966] [2020-02-10 19:35:07,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:07,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:07,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782222267] [2020-02-10 19:35:07,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:07,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:07,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:07,676 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:35:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:07,863 INFO L93 Difference]: Finished difference Result 6068 states and 26909 transitions. [2020-02-10 19:35:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:07,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:07,879 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 19:35:07,879 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 19:35:07,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 19:35:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3104. [2020-02-10 19:35:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 19:35:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15518 transitions. [2020-02-10 19:35:08,100 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15518 transitions. Word has length 31 [2020-02-10 19:35:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:08,100 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15518 transitions. [2020-02-10 19:35:08,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15518 transitions. [2020-02-10 19:35:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:08,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:08,106 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 316275074, now seen corresponding path program 241 times [2020-02-10 19:35:08,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:08,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622722910] [2020-02-10 19:35:08,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:08,636 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:08,768 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:08,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622722910] [2020-02-10 19:35:08,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:08,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:08,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543206865] [2020-02-10 19:35:08,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:08,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:08,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:08,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:08,779 INFO L87 Difference]: Start difference. First operand 3104 states and 15518 transitions. Second operand 12 states. [2020-02-10 19:35:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:09,008 INFO L93 Difference]: Finished difference Result 5976 states and 26732 transitions. [2020-02-10 19:35:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:09,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:09,023 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 19:35:09,023 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 19:35:09,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 19:35:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-02-10 19:35:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15599 transitions. [2020-02-10 19:35:09,232 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15599 transitions. Word has length 31 [2020-02-10 19:35:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:09,232 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15599 transitions. [2020-02-10 19:35:09,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15599 transitions. [2020-02-10 19:35:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:09,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:09,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:09,238 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash -106210652, now seen corresponding path program 242 times [2020-02-10 19:35:09,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:09,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930365321] [2020-02-10 19:35:09,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:09,771 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:35:09,902 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:09,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930365321] [2020-02-10 19:35:09,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:09,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:09,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749745272] [2020-02-10 19:35:09,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:09,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:09,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:09,912 INFO L87 Difference]: Start difference. First operand 3124 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:35:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:10,146 INFO L93 Difference]: Finished difference Result 5973 states and 26721 transitions. [2020-02-10 19:35:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:10,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:10,161 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 19:35:10,161 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 19:35:10,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 19:35:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3119. [2020-02-10 19:35:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15585 transitions. [2020-02-10 19:35:10,377 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15585 transitions. Word has length 31 [2020-02-10 19:35:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:10,377 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15585 transitions. [2020-02-10 19:35:10,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15585 transitions. [2020-02-10 19:35:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:10,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:10,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:10,382 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash -108036162, now seen corresponding path program 243 times [2020-02-10 19:35:10,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:10,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183753199] [2020-02-10 19:35:10,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:10,921 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:11,053 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:11,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183753199] [2020-02-10 19:35:11,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:11,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:11,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736840923] [2020-02-10 19:35:11,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:11,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:11,062 INFO L87 Difference]: Start difference. First operand 3119 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:35:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:11,289 INFO L93 Difference]: Finished difference Result 5983 states and 26744 transitions. [2020-02-10 19:35:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:11,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:11,303 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 19:35:11,303 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 19:35:11,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 19:35:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3127. [2020-02-10 19:35:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:35:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15600 transitions. [2020-02-10 19:35:11,519 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15600 transitions. Word has length 31 [2020-02-10 19:35:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:11,519 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15600 transitions. [2020-02-10 19:35:11,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15600 transitions. [2020-02-10 19:35:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:11,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:11,568 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1375493340, now seen corresponding path program 244 times [2020-02-10 19:35:11,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:11,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764385129] [2020-02-10 19:35:11,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:12,137 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:12,269 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:35:12,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 19:35:12,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764385129] [2020-02-10 19:35:12,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:12,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:12,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923411389] [2020-02-10 19:35:12,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:12,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:12,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:12,280 INFO L87 Difference]: Start difference. First operand 3127 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:35:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:12,546 INFO L93 Difference]: Finished difference Result 5984 states and 26738 transitions. [2020-02-10 19:35:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:12,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:12,561 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 19:35:12,561 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 19:35:12,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 19:35:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-02-10 19:35:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 19:35:12,769 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 19:35:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:12,769 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 19:35:12,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 19:35:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:12,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:12,774 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:12,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:12,775 INFO L82 PathProgramCache]: Analyzing trace with hash -742677506, now seen corresponding path program 245 times [2020-02-10 19:35:12,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:12,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870467573] [2020-02-10 19:35:12,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:13,303 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:13,435 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:35:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:13,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870467573] [2020-02-10 19:35:13,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:13,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:13,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73375458] [2020-02-10 19:35:13,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:13,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:13,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:13,446 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:35:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:13,744 INFO L93 Difference]: Finished difference Result 5974 states and 26718 transitions. [2020-02-10 19:35:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:13,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:13,759 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:35:13,759 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 19:35:13,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 19:35:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 19:35:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 19:35:13,975 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 19:35:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:13,975 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 19:35:13,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 19:35:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:13,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:13,980 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1587648958, now seen corresponding path program 246 times [2020-02-10 19:35:13,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:13,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166920037] [2020-02-10 19:35:13,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:14,624 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:35:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:14,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166920037] [2020-02-10 19:35:14,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:14,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:14,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523717246] [2020-02-10 19:35:14,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:14,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:14,634 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:35:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:14,884 INFO L93 Difference]: Finished difference Result 5978 states and 26721 transitions. [2020-02-10 19:35:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:14,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:14,899 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 19:35:14,899 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 19:35:14,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 19:35:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3114. [2020-02-10 19:35:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:35:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15566 transitions. [2020-02-10 19:35:15,108 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15566 transitions. Word has length 31 [2020-02-10 19:35:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:15,109 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15566 transitions. [2020-02-10 19:35:15,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15566 transitions. [2020-02-10 19:35:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:15,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:15,115 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash 47528646, now seen corresponding path program 247 times [2020-02-10 19:35:15,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:15,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629659009] [2020-02-10 19:35:15,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:15,666 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:15,799 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:15,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629659009] [2020-02-10 19:35:15,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:15,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:15,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962629730] [2020-02-10 19:35:15,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:15,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:15,809 INFO L87 Difference]: Start difference. First operand 3114 states and 15566 transitions. Second operand 12 states. [2020-02-10 19:35:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:16,065 INFO L93 Difference]: Finished difference Result 5971 states and 26715 transitions. [2020-02-10 19:35:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:16,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:16,082 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 19:35:16,082 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 19:35:16,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 19:35:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 19:35:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 19:35:16,304 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 19:35:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:16,304 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 19:35:16,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 19:35:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:16,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:16,310 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash -374957080, now seen corresponding path program 248 times [2020-02-10 19:35:16,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:16,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195259366] [2020-02-10 19:35:16,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:16,838 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:35:16,971 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:16,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195259366] [2020-02-10 19:35:16,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:16,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:16,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190547430] [2020-02-10 19:35:16,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:16,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:16,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:16,982 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:35:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:17,301 INFO L93 Difference]: Finished difference Result 5968 states and 26704 transitions. [2020-02-10 19:35:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:17,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:17,316 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:35:17,317 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:35:17,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:35:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 19:35:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 19:35:17,533 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 19:35:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:17,533 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 19:35:17,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 19:35:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:17,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:17,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:17,538 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:17,538 INFO L82 PathProgramCache]: Analyzing trace with hash -801093826, now seen corresponding path program 249 times [2020-02-10 19:35:17,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:17,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254848206] [2020-02-10 19:35:17,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:18,064 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:35:18,194 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:18,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254848206] [2020-02-10 19:35:18,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:18,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:18,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049853568] [2020-02-10 19:35:18,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:18,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:18,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:18,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:18,203 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:35:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:18,451 INFO L93 Difference]: Finished difference Result 5973 states and 26715 transitions. [2020-02-10 19:35:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:18,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:18,466 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 19:35:18,467 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 19:35:18,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 19:35:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-02-10 19:35:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:35:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 19:35:18,675 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 19:35:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:18,675 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 19:35:18,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 19:35:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:18,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:18,680 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1381444840, now seen corresponding path program 250 times [2020-02-10 19:35:18,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:18,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60045361] [2020-02-10 19:35:18,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:19,036 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2020-02-10 19:35:19,258 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:35:19,390 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:19,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 19:35:19,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60045361] [2020-02-10 19:35:19,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:19,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:19,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623039258] [2020-02-10 19:35:19,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:19,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:19,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:19,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:19,401 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 19:35:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:19,632 INFO L93 Difference]: Finished difference Result 5971 states and 26705 transitions. [2020-02-10 19:35:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:19,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:19,647 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 19:35:19,647 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 19:35:19,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 19:35:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-02-10 19:35:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 19:35:19,855 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 19:35:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:19,855 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 19:35:19,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 19:35:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:19,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:19,860 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:19,860 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:19,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1435735170, now seen corresponding path program 251 times [2020-02-10 19:35:19,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:19,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788185927] [2020-02-10 19:35:19,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:20,396 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:35:20,531 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:20,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788185927] [2020-02-10 19:35:20,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:20,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:20,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338575330] [2020-02-10 19:35:20,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:20,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:20,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:20,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:20,542 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:35:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:20,767 INFO L93 Difference]: Finished difference Result 5966 states and 26695 transitions. [2020-02-10 19:35:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:20,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:20,781 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 19:35:20,781 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 19:35:20,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 19:35:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-02-10 19:35:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 19:35:20,991 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 19:35:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:20,991 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 19:35:20,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 19:35:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:20,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:20,996 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1169289222, now seen corresponding path program 252 times [2020-02-10 19:35:20,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:20,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11302287] [2020-02-10 19:35:20,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:21,537 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:35:21,667 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:21,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 19:35:21,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11302287] [2020-02-10 19:35:21,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:21,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:21,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764909430] [2020-02-10 19:35:21,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:21,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:21,678 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:35:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:21,906 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 19:35:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:21,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:21,921 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 19:35:21,922 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 19:35:21,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 19:35:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-02-10 19:35:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:35:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-02-10 19:35:22,130 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-02-10 19:35:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:22,130 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-02-10 19:35:22,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-02-10 19:35:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:22,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:22,135 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -645529018, now seen corresponding path program 253 times [2020-02-10 19:35:22,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:22,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341159419] [2020-02-10 19:35:22,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:22,794 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:22,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341159419] [2020-02-10 19:35:22,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:22,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:22,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112823168] [2020-02-10 19:35:22,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:22,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:22,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:22,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:22,805 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-02-10 19:35:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:23,043 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-02-10 19:35:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:23,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:23,058 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 19:35:23,058 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:35:23,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:35:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3128. [2020-02-10 19:35:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:35:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15599 transitions. [2020-02-10 19:35:23,276 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15599 transitions. Word has length 31 [2020-02-10 19:35:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:23,276 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15599 transitions. [2020-02-10 19:35:23,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15599 transitions. [2020-02-10 19:35:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:23,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:23,282 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:23,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1912986196, now seen corresponding path program 254 times [2020-02-10 19:35:23,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:23,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483041293] [2020-02-10 19:35:23,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:23,946 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:23,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483041293] [2020-02-10 19:35:23,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:23,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:23,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441342538] [2020-02-10 19:35:23,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:23,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:23,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:23,957 INFO L87 Difference]: Start difference. First operand 3128 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:35:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:24,194 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-02-10 19:35:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:24,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:24,210 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 19:35:24,210 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 19:35:24,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 19:35:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3120. [2020-02-10 19:35:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:35:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15578 transitions. [2020-02-10 19:35:24,428 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15578 transitions. Word has length 31 [2020-02-10 19:35:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:24,428 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15578 transitions. [2020-02-10 19:35:24,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15578 transitions. [2020-02-10 19:35:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:24,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:24,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:24,434 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1069840254, now seen corresponding path program 255 times [2020-02-10 19:35:24,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:24,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478995155] [2020-02-10 19:35:24,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:24,963 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:35:25,094 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:25,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478995155] [2020-02-10 19:35:25,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:25,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:25,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128110062] [2020-02-10 19:35:25,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:25,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:25,104 INFO L87 Difference]: Start difference. First operand 3120 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:35:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:25,361 INFO L93 Difference]: Finished difference Result 5982 states and 26733 transitions. [2020-02-10 19:35:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:25,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:25,376 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 19:35:25,376 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 19:35:25,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 19:35:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3126. [2020-02-10 19:35:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:35:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15589 transitions. [2020-02-10 19:35:25,603 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15589 transitions. Word has length 31 [2020-02-10 19:35:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:25,603 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15589 transitions. [2020-02-10 19:35:25,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15589 transitions. [2020-02-10 19:35:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:25,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:25,610 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1112698412, now seen corresponding path program 256 times [2020-02-10 19:35:25,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:25,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12258014] [2020-02-10 19:35:25,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:26,145 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:35:26,280 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:26,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12258014] [2020-02-10 19:35:26,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:26,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:26,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885660353] [2020-02-10 19:35:26,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:26,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:26,291 INFO L87 Difference]: Start difference. First operand 3126 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:35:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:26,559 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-02-10 19:35:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:26,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:26,574 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:35:26,574 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 19:35:26,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 19:35:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3120. [2020-02-10 19:35:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:35:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 19:35:26,790 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 19:35:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:26,791 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 19:35:26,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 19:35:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:26,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:26,796 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:26,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1321203010, now seen corresponding path program 257 times [2020-02-10 19:35:26,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:26,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993439907] [2020-02-10 19:35:26,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:27,336 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:27,469 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:27,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993439907] [2020-02-10 19:35:27,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:27,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:27,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595996835] [2020-02-10 19:35:27,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:27,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:27,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:27,480 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:35:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:27,754 INFO L93 Difference]: Finished difference Result 5984 states and 26731 transitions. [2020-02-10 19:35:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:27,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:27,769 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 19:35:27,769 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 19:35:27,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 19:35:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-02-10 19:35:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:35:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-02-10 19:35:27,978 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-02-10 19:35:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:27,978 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-02-10 19:35:27,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-02-10 19:35:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:27,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:27,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:27,984 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 476231558, now seen corresponding path program 258 times [2020-02-10 19:35:27,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:27,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334122267] [2020-02-10 19:35:27,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:28,519 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:28,650 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:28,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334122267] [2020-02-10 19:35:28,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:28,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:28,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846644137] [2020-02-10 19:35:28,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:28,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:28,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:28,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:28,660 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:35:28,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:28,927 INFO L93 Difference]: Finished difference Result 5981 states and 26719 transitions. [2020-02-10 19:35:28,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:28,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:28,942 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 19:35:28,943 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 19:35:28,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 19:35:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-02-10 19:35:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:35:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 19:35:29,159 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 19:35:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:29,159 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 19:35:29,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 19:35:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:29,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:29,164 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 732940072, now seen corresponding path program 259 times [2020-02-10 19:35:29,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:29,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985549671] [2020-02-10 19:35:29,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:29,697 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:29,827 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:35:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:29,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985549671] [2020-02-10 19:35:29,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:29,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:29,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847496781] [2020-02-10 19:35:29,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:29,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:29,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:29,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:29,837 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 19:35:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:30,074 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 19:35:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:30,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:30,089 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 19:35:30,089 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 19:35:30,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 19:35:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-02-10 19:35:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 19:35:30,303 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 19:35:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:30,303 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 19:35:30,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 19:35:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:30,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:30,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:30,308 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:30,308 INFO L82 PathProgramCache]: Analyzing trace with hash -112031380, now seen corresponding path program 260 times [2020-02-10 19:35:30,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:30,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840596427] [2020-02-10 19:35:30,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:30,834 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:30,967 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:35:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:30,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840596427] [2020-02-10 19:35:30,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:30,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:30,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835282937] [2020-02-10 19:35:30,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:30,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:30,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:30,976 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:35:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:31,265 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-02-10 19:35:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:31,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:31,280 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:35:31,280 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 19:35:31,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 19:35:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-02-10 19:35:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 19:35:31,488 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 19:35:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:31,488 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 19:35:31,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 19:35:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:31,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:31,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:31,493 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:31,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:31,494 INFO L82 PathProgramCache]: Analyzing trace with hash 308628836, now seen corresponding path program 261 times [2020-02-10 19:35:31,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:31,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070096162] [2020-02-10 19:35:31,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:32,035 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:32,166 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:35:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:32,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070096162] [2020-02-10 19:35:32,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:32,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:32,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777116238] [2020-02-10 19:35:32,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:32,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:32,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:32,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:32,175 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:35:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:32,479 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 19:35:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:32,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:32,495 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 19:35:32,495 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 19:35:32,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 19:35:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-02-10 19:35:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 19:35:32,714 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 19:35:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:32,714 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 19:35:32,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 19:35:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:32,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:32,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:32,719 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1381314068, now seen corresponding path program 262 times [2020-02-10 19:35:32,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:32,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738056261] [2020-02-10 19:35:32,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:33,267 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:33,402 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:33,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738056261] [2020-02-10 19:35:33,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:33,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:33,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255205663] [2020-02-10 19:35:33,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:33,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:33,413 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:35:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:33,649 INFO L93 Difference]: Finished difference Result 5968 states and 26689 transitions. [2020-02-10 19:35:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:33,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:33,663 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:35:33,663 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 19:35:33,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 19:35:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-02-10 19:35:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 19:35:33,909 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 19:35:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:33,909 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 19:35:33,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 19:35:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:33,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:33,914 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:33,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:33,915 INFO L82 PathProgramCache]: Analyzing trace with hash -960653852, now seen corresponding path program 263 times [2020-02-10 19:35:33,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:33,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997961390] [2020-02-10 19:35:33,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:34,446 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:34,580 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:34,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997961390] [2020-02-10 19:35:34,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:34,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:34,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126330951] [2020-02-10 19:35:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:34,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:34,591 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:35:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:34,863 INFO L93 Difference]: Finished difference Result 5976 states and 26706 transitions. [2020-02-10 19:35:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:34,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:34,878 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 19:35:34,878 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 19:35:34,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 19:35:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3125. [2020-02-10 19:35:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:35:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 19:35:35,106 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 19:35:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:35,106 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 19:35:35,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 19:35:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:35,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:35,111 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1805625304, now seen corresponding path program 264 times [2020-02-10 19:35:35,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:35,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156340886] [2020-02-10 19:35:35,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:35,773 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:35,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 19:35:35,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156340886] [2020-02-10 19:35:35,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:35,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:35,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708578534] [2020-02-10 19:35:35,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:35,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:35,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:35,784 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:35:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:36,056 INFO L93 Difference]: Finished difference Result 5973 states and 26694 transitions. [2020-02-10 19:35:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:36,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:36,070 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 19:35:36,071 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 19:35:36,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 19:35:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3109. [2020-02-10 19:35:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 19:35:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15542 transitions. [2020-02-10 19:35:36,284 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15542 transitions. Word has length 31 [2020-02-10 19:35:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:36,284 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15542 transitions. [2020-02-10 19:35:36,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15542 transitions. [2020-02-10 19:35:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:36,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:36,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:36,289 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 575070398, now seen corresponding path program 265 times [2020-02-10 19:35:36,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:36,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689206092] [2020-02-10 19:35:36,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:36,836 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:36,963 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:36,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689206092] [2020-02-10 19:35:36,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:36,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:36,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034022767] [2020-02-10 19:35:36,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:36,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:36,973 INFO L87 Difference]: Start difference. First operand 3109 states and 15542 transitions. Second operand 12 states. [2020-02-10 19:35:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:37,277 INFO L93 Difference]: Finished difference Result 5980 states and 26739 transitions. [2020-02-10 19:35:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:37,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:37,293 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:35:37,293 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 19:35:37,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 19:35:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3124. [2020-02-10 19:35:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 19:35:37,508 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 19:35:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:37,508 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 19:35:37,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 19:35:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:37,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:37,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:37,513 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash 152584672, now seen corresponding path program 266 times [2020-02-10 19:35:37,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:37,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184220810] [2020-02-10 19:35:37,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:38,055 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 19:35:38,183 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:38,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184220810] [2020-02-10 19:35:38,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:38,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:38,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003162943] [2020-02-10 19:35:38,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:38,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:38,192 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:35:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:38,550 INFO L93 Difference]: Finished difference Result 5977 states and 26728 transitions. [2020-02-10 19:35:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:38,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:38,565 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 19:35:38,565 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 19:35:38,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 19:35:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-02-10 19:35:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 19:35:38,790 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 19:35:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:38,790 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 19:35:38,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 19:35:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:38,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:38,796 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash 150759162, now seen corresponding path program 267 times [2020-02-10 19:35:38,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:38,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671374253] [2020-02-10 19:35:38,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:39,334 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:39,465 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:39,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671374253] [2020-02-10 19:35:39,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:39,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:39,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333677203] [2020-02-10 19:35:39,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:39,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:39,475 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:35:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:39,730 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-02-10 19:35:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:39,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:39,745 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 19:35:39,746 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:35:39,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:35:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3127. [2020-02-10 19:35:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:35:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-02-10 19:35:39,960 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-02-10 19:35:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:39,960 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-02-10 19:35:39,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-02-10 19:35:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:39,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:39,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:39,965 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1116698016, now seen corresponding path program 268 times [2020-02-10 19:35:39,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:39,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608856284] [2020-02-10 19:35:39,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:40,515 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:40,648 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:40,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608856284] [2020-02-10 19:35:40,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:40,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:40,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399874509] [2020-02-10 19:35:40,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:40,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:40,659 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:35:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:40,925 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-02-10 19:35:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:40,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:40,939 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 19:35:40,939 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 19:35:40,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 19:35:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3119. [2020-02-10 19:35:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 19:35:41,203 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 19:35:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:41,203 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 19:35:41,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 19:35:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:41,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:41,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:41,208 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash -483882182, now seen corresponding path program 269 times [2020-02-10 19:35:41,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:41,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9657426] [2020-02-10 19:35:41,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:41,743 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:35:41,888 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:41,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9657426] [2020-02-10 19:35:41,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:41,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:41,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007536276] [2020-02-10 19:35:41,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:41,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:41,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:41,897 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:35:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:42,165 INFO L93 Difference]: Finished difference Result 5978 states and 26725 transitions. [2020-02-10 19:35:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:42,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:42,180 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 19:35:42,180 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 19:35:42,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 19:35:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3124. [2020-02-10 19:35:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 19:35:42,389 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 19:35:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:42,389 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 19:35:42,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 19:35:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:42,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:42,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:42,394 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1328853634, now seen corresponding path program 270 times [2020-02-10 19:35:42,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:42,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882814015] [2020-02-10 19:35:42,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:42,926 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:43,057 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:43,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882814015] [2020-02-10 19:35:43,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:43,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:43,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647992125] [2020-02-10 19:35:43,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:43,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:43,068 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:35:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:43,338 INFO L93 Difference]: Finished difference Result 5982 states and 26728 transitions. [2020-02-10 19:35:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:43,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:43,354 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 19:35:43,354 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 19:35:43,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 19:35:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-02-10 19:35:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:35:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-02-10 19:35:43,565 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-02-10 19:35:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:43,565 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-02-10 19:35:43,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-02-10 19:35:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:43,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:43,570 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash 37577542, now seen corresponding path program 271 times [2020-02-10 19:35:43,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:43,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417660541] [2020-02-10 19:35:43,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:44,103 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:44,238 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:44,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417660541] [2020-02-10 19:35:44,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:44,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:44,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653207876] [2020-02-10 19:35:44,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:44,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:44,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:44,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:44,249 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-02-10 19:35:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:44,534 INFO L93 Difference]: Finished difference Result 5977 states and 26727 transitions. [2020-02-10 19:35:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:44,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:44,549 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 19:35:44,550 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 19:35:44,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 19:35:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 19:35:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 19:35:44,766 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 19:35:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:44,766 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 19:35:44,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 19:35:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:44,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:44,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:44,772 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -384908184, now seen corresponding path program 272 times [2020-02-10 19:35:44,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:44,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390075996] [2020-02-10 19:35:44,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:45,306 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 19:35:45,435 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:45,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390075996] [2020-02-10 19:35:45,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:45,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:45,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547646188] [2020-02-10 19:35:45,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:45,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:45,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:45,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:45,446 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:35:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:45,700 INFO L93 Difference]: Finished difference Result 5974 states and 26716 transitions. [2020-02-10 19:35:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:45,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:45,715 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:35:45,716 INFO L226 Difference]: Without dead ends: 5953 [2020-02-10 19:35:45,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-02-10 19:35:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-02-10 19:35:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 19:35:45,926 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 19:35:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:45,927 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 19:35:45,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 19:35:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:45,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:45,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:45,932 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1235356166, now seen corresponding path program 273 times [2020-02-10 19:35:45,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:45,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851873426] [2020-02-10 19:35:45,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:46,479 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:46,612 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:46,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851873426] [2020-02-10 19:35:46,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:46,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:46,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434823265] [2020-02-10 19:35:46,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:46,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:46,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:46,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:46,622 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:35:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:46,862 INFO L93 Difference]: Finished difference Result 5981 states and 26732 transitions. [2020-02-10 19:35:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:46,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:46,878 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 19:35:46,878 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 19:35:46,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 19:35:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3126. [2020-02-10 19:35:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:35:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 19:35:47,093 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 19:35:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:47,093 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 19:35:47,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 19:35:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:47,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:47,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:47,098 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash 102211048, now seen corresponding path program 274 times [2020-02-10 19:35:47,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:47,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36809890] [2020-02-10 19:35:47,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:47,644 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:47,774 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:47,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36809890] [2020-02-10 19:35:47,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:47,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:47,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066381949] [2020-02-10 19:35:47,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:47,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:47,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:47,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:47,784 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:35:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:48,011 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-02-10 19:35:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:48,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:48,026 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:35:48,026 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 19:35:48,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 19:35:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-02-10 19:35:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 19:35:48,239 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 19:35:48,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:48,239 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 19:35:48,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 19:35:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:48,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:48,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:48,245 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1869997510, now seen corresponding path program 275 times [2020-02-10 19:35:48,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:48,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362457259] [2020-02-10 19:35:48,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:48,697 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2020-02-10 19:35:48,820 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:35:48,951 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:48,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362457259] [2020-02-10 19:35:48,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:48,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:48,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872050782] [2020-02-10 19:35:48,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:48,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:48,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:48,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:48,962 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:35:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:49,206 INFO L93 Difference]: Finished difference Result 5973 states and 26709 transitions. [2020-02-10 19:35:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:49,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:49,221 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 19:35:49,221 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 19:35:49,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 19:35:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-02-10 19:35:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 19:35:49,429 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 19:35:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:49,429 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 19:35:49,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 19:35:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:49,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:49,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:49,434 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash -109944570, now seen corresponding path program 276 times [2020-02-10 19:35:49,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:49,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190196641] [2020-02-10 19:35:49,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:49,955 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:50,086 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:50,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190196641] [2020-02-10 19:35:50,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:50,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:50,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310638375] [2020-02-10 19:35:50,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:50,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:50,096 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:35:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:50,324 INFO L93 Difference]: Finished difference Result 5975 states and 26708 transitions. [2020-02-10 19:35:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:50,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:50,339 INFO L225 Difference]: With dead ends: 5975 [2020-02-10 19:35:50,340 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:35:50,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:35:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3114. [2020-02-10 19:35:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:35:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 19:35:50,553 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 19:35:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:50,553 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 19:35:50,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 19:35:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:50,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:50,558 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:50,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:50,559 INFO L82 PathProgramCache]: Analyzing trace with hash -655480122, now seen corresponding path program 277 times [2020-02-10 19:35:50,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:50,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544061132] [2020-02-10 19:35:50,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:51,095 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:51,220 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35: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 19:35:51,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544061132] [2020-02-10 19:35:51,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:51,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:51,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777286448] [2020-02-10 19:35:51,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:51,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:51,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:51,230 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 19:35:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:51,464 INFO L93 Difference]: Finished difference Result 5995 states and 26770 transitions. [2020-02-10 19:35:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:51,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:51,480 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 19:35:51,480 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 19:35:51,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 19:35:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3129. [2020-02-10 19:35:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:35:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15598 transitions. [2020-02-10 19:35:51,695 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15598 transitions. Word has length 31 [2020-02-10 19:35:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:51,695 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15598 transitions. [2020-02-10 19:35:51,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15598 transitions. [2020-02-10 19:35:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:51,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:51,701 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1922937300, now seen corresponding path program 278 times [2020-02-10 19:35:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:51,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292175100] [2020-02-10 19:35:51,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:52,241 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:52,369 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:52,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292175100] [2020-02-10 19:35:52,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:52,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:52,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932396731] [2020-02-10 19:35:52,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:52,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:52,378 INFO L87 Difference]: Start difference. First operand 3129 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:35:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:52,679 INFO L93 Difference]: Finished difference Result 5996 states and 26764 transitions. [2020-02-10 19:35:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:52,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:52,694 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 19:35:52,694 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:35:52,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:35:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 19:35:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:35:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-02-10 19:35:52,902 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-02-10 19:35:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:52,902 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-02-10 19:35:52,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-02-10 19:35:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:52,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:52,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:52,907 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1504102594, now seen corresponding path program 279 times [2020-02-10 19:35:52,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:52,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505510479] [2020-02-10 19:35:52,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:53,465 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:53,592 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:35:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:53,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505510479] [2020-02-10 19:35:53,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:53,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:53,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451656144] [2020-02-10 19:35:53,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:53,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:53,603 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:35:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:53,830 INFO L93 Difference]: Finished difference Result 5992 states and 26756 transitions. [2020-02-10 19:35:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:53,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:53,846 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 19:35:53,846 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 19:35:53,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 19:35:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3128. [2020-02-10 19:35:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:35:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-02-10 19:35:54,068 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-02-10 19:35:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:54,068 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-02-10 19:35:54,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-02-10 19:35:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:54,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:54,074 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash -166535380, now seen corresponding path program 280 times [2020-02-10 19:35:54,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:54,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156003783] [2020-02-10 19:35:54,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:54,621 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:35:54,752 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:35:54,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 19:35:54,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156003783] [2020-02-10 19:35:54,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:54,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:54,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544582518] [2020-02-10 19:35:54,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:54,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:54,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:54,762 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:35:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:55,027 INFO L93 Difference]: Finished difference Result 5991 states and 26747 transitions. [2020-02-10 19:35:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:55,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:55,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:55,043 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 19:35:55,043 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 19:35:55,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 19:35:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-02-10 19:35:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:35:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15569 transitions. [2020-02-10 19:35:55,256 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15569 transitions. Word has length 31 [2020-02-10 19:35:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:55,256 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15569 transitions. [2020-02-10 19:35:55,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15569 transitions. [2020-02-10 19:35:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:55,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:55,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:55,261 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash 886940670, now seen corresponding path program 281 times [2020-02-10 19:35:55,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:55,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822829240] [2020-02-10 19:35:55,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:55,799 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:55,929 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:35:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:55,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822829240] [2020-02-10 19:35:55,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:55,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:55,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139682007] [2020-02-10 19:35:55,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:55,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:55,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:55,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:55,939 INFO L87 Difference]: Start difference. First operand 3121 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:35:56,173 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-02-10 19:35:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:56,194 INFO L93 Difference]: Finished difference Result 5994 states and 26753 transitions. [2020-02-10 19:35:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:56,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:56,210 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 19:35:56,210 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 19:35:56,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 19:35:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-02-10 19:35:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:35:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15582 transitions. [2020-02-10 19:35:56,424 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15582 transitions. Word has length 31 [2020-02-10 19:35:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:56,424 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15582 transitions. [2020-02-10 19:35:56,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15582 transitions. [2020-02-10 19:35:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:56,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:56,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:56,429 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:56,429 INFO L82 PathProgramCache]: Analyzing trace with hash -803002234, now seen corresponding path program 282 times [2020-02-10 19:35:56,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:56,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851855652] [2020-02-10 19:35:56,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:56,965 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:35:57,095 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:35:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:57,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851855652] [2020-02-10 19:35:57,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:57,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:57,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394036836] [2020-02-10 19:35:57,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:57,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:57,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:57,106 INFO L87 Difference]: Start difference. First operand 3128 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:35:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:57,403 INFO L93 Difference]: Finished difference Result 5992 states and 26742 transitions. [2020-02-10 19:35:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:57,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:57,418 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 19:35:57,418 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 19:35:57,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 19:35:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3114. [2020-02-10 19:35:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:35:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-02-10 19:35:57,626 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-02-10 19:35:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:57,626 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-02-10 19:35:57,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-02-10 19:35:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:57,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:57,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:57,631 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 722988968, now seen corresponding path program 283 times [2020-02-10 19:35:57,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:57,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605630355] [2020-02-10 19:35:57,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:58,150 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:35:58,283 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:35:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:35:58,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605630355] [2020-02-10 19:35:58,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:58,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:58,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016283633] [2020-02-10 19:35:58,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:58,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:58,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:58,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:58,292 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-02-10 19:35:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:58,519 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-02-10 19:35:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:58,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:58,535 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 19:35:58,535 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 19:35:58,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 19:35:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3124. [2020-02-10 19:35:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:35:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 19:35:58,749 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 19:35:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:58,749 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 19:35:58,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 19:35:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:58,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:58,754 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -121982484, now seen corresponding path program 284 times [2020-02-10 19:35:58,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:58,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985689002] [2020-02-10 19:35:58,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:35:59,276 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:35:59,410 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:35:59,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 19:35:59,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985689002] [2020-02-10 19:35:59,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:35:59,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:35:59,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922740123] [2020-02-10 19:35:59,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:35:59,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:35:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:35:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:35:59,419 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:35:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:35:59,640 INFO L93 Difference]: Finished difference Result 5980 states and 26718 transitions. [2020-02-10 19:35:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:35:59,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:35:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:35:59,656 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:35:59,656 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 19:35:59,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:35:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 19:35:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-02-10 19:35:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:35:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 19:35:59,870 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 19:35:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:35:59,870 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 19:35:59,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:35:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 19:35:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:35:59,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:35:59,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:35:59,875 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:35:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:35:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash -125633504, now seen corresponding path program 285 times [2020-02-10 19:35:59,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:35:59,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355853669] [2020-02-10 19:35:59,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:35:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:00,420 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:36:00,553 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:36:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:00,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355853669] [2020-02-10 19:36:00,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:00,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:00,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243888146] [2020-02-10 19:36:00,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:00,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:00,563 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:36:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:00,847 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-02-10 19:36:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:00,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:00,861 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:36:00,861 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 19:36:00,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 19:36:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 19:36:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:36:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 19:36:01,072 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 19:36:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:01,072 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 19:36:01,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 19:36:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:01,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:01,079 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1634419436, now seen corresponding path program 286 times [2020-02-10 19:36:01,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:01,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546921742] [2020-02-10 19:36:01,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:01,611 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:36:01,740 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:36:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:01,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546921742] [2020-02-10 19:36:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:01,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412603043] [2020-02-10 19:36:01,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:01,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:01,751 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:36:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:01,978 INFO L93 Difference]: Finished difference Result 5976 states and 26705 transitions. [2020-02-10 19:36:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:01,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:01,993 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 19:36:01,993 INFO L226 Difference]: Without dead ends: 5953 [2020-02-10 19:36:01,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-02-10 19:36:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-02-10 19:36:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:36:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 19:36:02,200 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 19:36:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:02,200 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 19:36:02,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 19:36:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:02,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:02,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:02,206 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1394916192, now seen corresponding path program 287 times [2020-02-10 19:36:02,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:02,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794628630] [2020-02-10 19:36:02,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:02,736 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:02,870 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:36:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:02,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794628630] [2020-02-10 19:36:02,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:02,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:02,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654662539] [2020-02-10 19:36:02,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:02,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:02,880 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:36:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:03,173 INFO L93 Difference]: Finished difference Result 5984 states and 26723 transitions. [2020-02-10 19:36:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:03,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:03,188 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 19:36:03,188 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 19:36:03,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 19:36:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-02-10 19:36:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:36:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-02-10 19:36:03,396 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-02-10 19:36:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:03,397 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-02-10 19:36:03,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-02-10 19:36:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:03,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:03,446 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1210108200, now seen corresponding path program 288 times [2020-02-10 19:36:03,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:03,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155720329] [2020-02-10 19:36:03,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:03,971 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:36:04,103 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:36:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:04,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155720329] [2020-02-10 19:36:04,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:04,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:04,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951357656] [2020-02-10 19:36:04,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:04,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:04,114 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-02-10 19:36:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:04,368 INFO L93 Difference]: Finished difference Result 5982 states and 26712 transitions. [2020-02-10 19:36:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:04,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:04,383 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 19:36:04,383 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:36:04,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:36:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3109. [2020-02-10 19:36:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 19:36:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15537 transitions. [2020-02-10 19:36:04,589 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15537 transitions. Word has length 31 [2020-02-10 19:36:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:04,590 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15537 transitions. [2020-02-10 19:36:04,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15537 transitions. [2020-02-10 19:36:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:04,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:04,595 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash 565119294, now seen corresponding path program 289 times [2020-02-10 19:36:04,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:04,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249800781] [2020-02-10 19:36:04,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:05,256 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:05,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249800781] [2020-02-10 19:36:05,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:05,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:05,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974907579] [2020-02-10 19:36:05,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:05,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:05,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:05,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:05,267 INFO L87 Difference]: Start difference. First operand 3109 states and 15537 transitions. Second operand 12 states. [2020-02-10 19:36:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:05,598 INFO L93 Difference]: Finished difference Result 5968 states and 26703 transitions. [2020-02-10 19:36:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:05,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:05,613 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:36:05,613 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 19:36:05,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 19:36:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-02-10 19:36:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:36:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 19:36:05,822 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 19:36:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:05,822 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 19:36:05,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 19:36:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:05,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:05,827 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:05,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash 142633568, now seen corresponding path program 290 times [2020-02-10 19:36:05,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:05,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107078958] [2020-02-10 19:36:05,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:06,370 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:36:06,499 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:06,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107078958] [2020-02-10 19:36:06,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:06,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:06,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493413656] [2020-02-10 19:36:06,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:06,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:06,509 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:36:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:06,753 INFO L93 Difference]: Finished difference Result 5965 states and 26692 transitions. [2020-02-10 19:36:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:06,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:06,768 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 19:36:06,768 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 19:36:06,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 19:36:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-02-10 19:36:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:36:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 19:36:06,981 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 19:36:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:06,982 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 19:36:06,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 19:36:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:06,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:06,987 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:06,987 INFO L82 PathProgramCache]: Analyzing trace with hash -283503178, now seen corresponding path program 291 times [2020-02-10 19:36:06,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:06,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122490466] [2020-02-10 19:36:06,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:07,526 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:07,655 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:07,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122490466] [2020-02-10 19:36:07,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:07,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:07,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076676412] [2020-02-10 19:36:07,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:07,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:07,666 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:36:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:07,979 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 19:36:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:07,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:07,994 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 19:36:07,994 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 19:36:07,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 19:36:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3125. [2020-02-10 19:36:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:36:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-02-10 19:36:08,209 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-02-10 19:36:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:08,209 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-02-10 19:36:08,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-02-10 19:36:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:08,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:08,214 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:08,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1899035488, now seen corresponding path program 292 times [2020-02-10 19:36:08,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:08,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642777865] [2020-02-10 19:36:08,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:08,750 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:08,876 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:08,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642777865] [2020-02-10 19:36:08,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:08,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:08,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14018696] [2020-02-10 19:36:08,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:08,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:08,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:08,887 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:36:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:09,138 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-02-10 19:36:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:09,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:09,154 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:36:09,154 INFO L226 Difference]: Without dead ends: 5945 [2020-02-10 19:36:09,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5945 states. [2020-02-10 19:36:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5945 to 3119. [2020-02-10 19:36:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:36:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 19:36:09,364 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 19:36:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:09,364 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 19:36:09,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 19:36:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:09,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:09,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:09,369 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:09,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:09,369 INFO L82 PathProgramCache]: Analyzing trace with hash -918144522, now seen corresponding path program 293 times [2020-02-10 19:36:09,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:09,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937387158] [2020-02-10 19:36:09,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:09,921 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:36:10,054 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:10,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937387158] [2020-02-10 19:36:10,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:10,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:10,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275982226] [2020-02-10 19:36:10,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:10,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:10,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:10,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:10,064 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:36:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:10,294 INFO L93 Difference]: Finished difference Result 5963 states and 26683 transitions. [2020-02-10 19:36:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:10,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:10,308 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 19:36:10,308 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:36:10,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:36:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 19:36:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:36:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 19:36:10,517 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 19:36:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:10,517 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 19:36:10,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 19:36:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:10,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:10,523 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1686879870, now seen corresponding path program 294 times [2020-02-10 19:36:10,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:10,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035773362] [2020-02-10 19:36:10,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:11,124 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:11,255 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:11,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035773362] [2020-02-10 19:36:11,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:11,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:11,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204044789] [2020-02-10 19:36:11,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:11,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:11,266 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:36:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:11,503 INFO L93 Difference]: Finished difference Result 5964 states and 26680 transitions. [2020-02-10 19:36:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:11,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:11,517 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 19:36:11,518 INFO L226 Difference]: Without dead ends: 5937 [2020-02-10 19:36:11,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5937 states. [2020-02-10 19:36:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5937 to 3114. [2020-02-10 19:36:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:36:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 19:36:11,729 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 19:36:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:11,729 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 19:36:11,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 19:36:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:11,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:11,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:11,734 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 296372866, now seen corresponding path program 295 times [2020-02-10 19:36:11,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:11,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858938847] [2020-02-10 19:36:11,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:12,393 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:12,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858938847] [2020-02-10 19:36:12,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:12,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:12,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074256643] [2020-02-10 19:36:12,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:12,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:12,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:12,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:12,403 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 19:36:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:12,654 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 19:36:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:12,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:12,669 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 19:36:12,670 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 19:36:12,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 19:36:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-02-10 19:36:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:36:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 19:36:12,884 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 19:36:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:12,884 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 19:36:12,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 19:36:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:12,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:12,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:12,890 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash -126112860, now seen corresponding path program 296 times [2020-02-10 19:36:12,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:12,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932591641] [2020-02-10 19:36:12,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:13,426 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 19:36:13,557 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:13,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932591641] [2020-02-10 19:36:13,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:13,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:13,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286241743] [2020-02-10 19:36:13,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:13,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:13,566 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:36:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:13,800 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 19:36:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:13,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:13,816 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 19:36:13,816 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 19:36:13,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 19:36:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-02-10 19:36:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:36:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 19:36:14,027 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 19:36:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:14,027 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 19:36:14,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 19:36:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:14,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:14,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:14,033 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash -976560842, now seen corresponding path program 297 times [2020-02-10 19:36:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:14,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896020835] [2020-02-10 19:36:14,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:14,583 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:36:14,715 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:14,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896020835] [2020-02-10 19:36:14,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:14,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:14,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9433255] [2020-02-10 19:36:14,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:14,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:14,725 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:36:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:14,952 INFO L93 Difference]: Finished difference Result 5974 states and 26708 transitions. [2020-02-10 19:36:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:14,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:14,968 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:36:14,968 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 19:36:14,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 19:36:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3126. [2020-02-10 19:36:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:36:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-02-10 19:36:15,176 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-02-10 19:36:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:15,176 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-02-10 19:36:15,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-02-10 19:36:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:15,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:15,181 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:15,181 INFO L82 PathProgramCache]: Analyzing trace with hash 361006372, now seen corresponding path program 298 times [2020-02-10 19:36:15,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:15,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832211109] [2020-02-10 19:36:15,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:15,725 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:15,861 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:15,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832211109] [2020-02-10 19:36:15,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:15,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:15,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206042698] [2020-02-10 19:36:15,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:15,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:15,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:15,871 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:36:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:16,116 INFO L93 Difference]: Finished difference Result 5973 states and 26699 transitions. [2020-02-10 19:36:16,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:16,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:16,130 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 19:36:16,130 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 19:36:16,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 19:36:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-02-10 19:36:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:36:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 19:36:16,337 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 19:36:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:16,337 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 19:36:16,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 19:36:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:16,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:16,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:16,342 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1611202186, now seen corresponding path program 299 times [2020-02-10 19:36:16,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:16,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653886044] [2020-02-10 19:36:16,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:16,884 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:17,020 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:17,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653886044] [2020-02-10 19:36:17,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:17,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:17,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373033916] [2020-02-10 19:36:17,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:17,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:17,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:17,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:17,029 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:36:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:17,259 INFO L93 Difference]: Finished difference Result 5966 states and 26685 transitions. [2020-02-10 19:36:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:17,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:17,274 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 19:36:17,274 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 19:36:17,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 19:36:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-02-10 19:36:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:36:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 19:36:17,482 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 19:36:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:17,482 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 19:36:17,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 19:36:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:17,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:17,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:17,488 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:17,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:17,488 INFO L82 PathProgramCache]: Analyzing trace with hash 148850754, now seen corresponding path program 300 times [2020-02-10 19:36:17,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:17,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304379076] [2020-02-10 19:36:17,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:18,033 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:18,169 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:18,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304379076] [2020-02-10 19:36:18,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:18,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:18,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071097875] [2020-02-10 19:36:18,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:18,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:18,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:18,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:18,179 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:36:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:18,431 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-02-10 19:36:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:18,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:18,445 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:36:18,445 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 19:36:18,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 19:36:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-02-10 19:36:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:36:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-02-10 19:36:18,700 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-02-10 19:36:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:18,700 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-02-10 19:36:18,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-02-10 19:36:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:18,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:18,706 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:18,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1089742462, now seen corresponding path program 301 times [2020-02-10 19:36:18,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:18,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086959783] [2020-02-10 19:36:18,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:19,245 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:19,379 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:19,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086959783] [2020-02-10 19:36:19,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:19,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:19,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555427405] [2020-02-10 19:36:19,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:19,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:19,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:19,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:19,389 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-02-10 19:36:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:19,693 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-02-10 19:36:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:19,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:19,708 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 19:36:19,708 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 19:36:19,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 19:36:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3126. [2020-02-10 19:36:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:36:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15585 transitions. [2020-02-10 19:36:19,917 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15585 transitions. Word has length 31 [2020-02-10 19:36:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:19,917 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15585 transitions. [2020-02-10 19:36:19,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15585 transitions. [2020-02-10 19:36:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:19,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:19,922 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1092796204, now seen corresponding path program 302 times [2020-02-10 19:36:19,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:19,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78857756] [2020-02-10 19:36:19,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:20,454 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:20,582 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:20,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78857756] [2020-02-10 19:36:20,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:20,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:20,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449081569] [2020-02-10 19:36:20,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:20,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:20,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:20,593 INFO L87 Difference]: Start difference. First operand 3126 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:36:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:20,885 INFO L93 Difference]: Finished difference Result 5974 states and 26705 transitions. [2020-02-10 19:36:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:20,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:20,901 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:36:20,901 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 19:36:20,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 19:36:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3120. [2020-02-10 19:36:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:36:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-02-10 19:36:21,113 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-02-10 19:36:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:21,114 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-02-10 19:36:21,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-02-10 19:36:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:21,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:21,119 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:21,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1514053698, now seen corresponding path program 303 times [2020-02-10 19:36:21,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:21,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704835021] [2020-02-10 19:36:21,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:21,674 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:21,806 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:36:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:21,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704835021] [2020-02-10 19:36:21,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:21,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:21,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935634651] [2020-02-10 19:36:21,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:21,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:21,820 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:36:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:22,111 INFO L93 Difference]: Finished difference Result 5978 states and 26714 transitions. [2020-02-10 19:36:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:22,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:22,126 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 19:36:22,126 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 19:36:22,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 19:36:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3127. [2020-02-10 19:36:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:36:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 19:36:22,339 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 19:36:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:22,339 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 19:36:22,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 19:36:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:22,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:22,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:22,344 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -176486484, now seen corresponding path program 304 times [2020-02-10 19:36:22,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:22,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194591565] [2020-02-10 19:36:22,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:22,894 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:23,027 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:23,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194591565] [2020-02-10 19:36:23,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:23,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:23,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18609433] [2020-02-10 19:36:23,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:23,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:23,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:23,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:23,037 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 19:36:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:23,287 INFO L93 Difference]: Finished difference Result 5977 states and 26705 transitions. [2020-02-10 19:36:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:23,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:23,304 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 19:36:23,304 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 19:36:23,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 19:36:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3120. [2020-02-10 19:36:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:36:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-02-10 19:36:23,511 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-02-10 19:36:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:23,511 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-02-10 19:36:23,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-02-10 19:36:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:23,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:23,517 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash -392293122, now seen corresponding path program 305 times [2020-02-10 19:36:23,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:23,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829495459] [2020-02-10 19:36:23,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:24,061 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:24,196 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:24,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829495459] [2020-02-10 19:36:24,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:24,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:24,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371252341] [2020-02-10 19:36:24,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:24,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:24,207 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-02-10 19:36:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:24,479 INFO L93 Difference]: Finished difference Result 5973 states and 26697 transitions. [2020-02-10 19:36:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:24,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:24,495 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 19:36:24,495 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 19:36:24,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 19:36:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3126. [2020-02-10 19:36:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:36:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-02-10 19:36:24,710 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-02-10 19:36:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:24,710 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-02-10 19:36:24,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-02-10 19:36:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:24,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:24,715 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1237264574, now seen corresponding path program 306 times [2020-02-10 19:36:24,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:24,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141679327] [2020-02-10 19:36:24,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:25,269 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:25,404 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:25,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141679327] [2020-02-10 19:36:25,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:25,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:25,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96065902] [2020-02-10 19:36:25,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:25,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:25,415 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-02-10 19:36:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:25,724 INFO L93 Difference]: Finished difference Result 5974 states and 26693 transitions. [2020-02-10 19:36:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:25,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:25,740 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:36:25,740 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 19:36:25,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 19:36:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3114. [2020-02-10 19:36:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:36:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-02-10 19:36:25,956 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-02-10 19:36:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:25,956 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-02-10 19:36:25,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-02-10 19:36:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:25,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:25,961 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:25,961 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:25,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:25,961 INFO L82 PathProgramCache]: Analyzing trace with hash 288726628, now seen corresponding path program 307 times [2020-02-10 19:36:25,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:25,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833217451] [2020-02-10 19:36:25,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:26,554 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:26,683 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-02-10 19:36:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:26,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833217451] [2020-02-10 19:36:26,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:26,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:26,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502462418] [2020-02-10 19:36:26,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:26,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:26,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:26,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:26,693 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-02-10 19:36:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:26,930 INFO L93 Difference]: Finished difference Result 5962 states and 26676 transitions. [2020-02-10 19:36:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:26,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:26,945 INFO L225 Difference]: With dead ends: 5962 [2020-02-10 19:36:26,945 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 19:36:26,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 19:36:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3124. [2020-02-10 19:36:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:36:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 19:36:27,159 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 19:36:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:27,160 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 19:36:27,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 19:36:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:27,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:27,165 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1401216276, now seen corresponding path program 308 times [2020-02-10 19:36:27,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:27,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740666458] [2020-02-10 19:36:27,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:27,714 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:27,844 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:27,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740666458] [2020-02-10 19:36:27,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:27,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:27,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96831665] [2020-02-10 19:36:27,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:27,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:27,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:27,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:27,854 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:36:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:28,085 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 19:36:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:28,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:28,101 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 19:36:28,101 INFO L226 Difference]: Without dead ends: 5941 [2020-02-10 19:36:28,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2020-02-10 19:36:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 3119. [2020-02-10 19:36:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:36:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 19:36:28,312 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 19:36:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:28,312 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 19:36:28,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 19:36:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:28,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:28,317 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -135584608, now seen corresponding path program 309 times [2020-02-10 19:36:28,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:28,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916251006] [2020-02-10 19:36:28,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:28,853 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:28,986 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:28,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916251006] [2020-02-10 19:36:28,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:28,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:28,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442865096] [2020-02-10 19:36:28,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:28,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:28,996 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:36:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:29,355 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 19:36:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:29,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:29,370 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 19:36:29,371 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:36:29,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:36:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 19:36:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:36:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 19:36:29,578 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 19:36:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:29,578 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 19:36:29,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 19:36:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:29,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:29,584 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1624468332, now seen corresponding path program 310 times [2020-02-10 19:36:29,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:29,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603640783] [2020-02-10 19:36:29,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:30,132 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:30,264 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:30,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603640783] [2020-02-10 19:36:30,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:30,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:30,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524697804] [2020-02-10 19:36:30,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:30,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:30,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:30,274 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:36:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:30,640 INFO L93 Difference]: Finished difference Result 5965 states and 26672 transitions. [2020-02-10 19:36:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:30,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:30,656 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 19:36:30,656 INFO L226 Difference]: Without dead ends: 5942 [2020-02-10 19:36:30,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-02-10 19:36:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-02-10 19:36:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:36:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 19:36:30,871 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 19:36:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:30,872 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 19:36:30,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 19:36:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:30,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:30,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:30,877 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1620817312, now seen corresponding path program 311 times [2020-02-10 19:36:30,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:30,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920832885] [2020-02-10 19:36:30,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:31,434 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:31,576 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:31,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920832885] [2020-02-10 19:36:31,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:31,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:31,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30177426] [2020-02-10 19:36:31,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:31,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:31,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:31,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:31,586 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 19:36:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:31,846 INFO L93 Difference]: Finished difference Result 5966 states and 26675 transitions. [2020-02-10 19:36:31,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:31,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:31,862 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 19:36:31,862 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 19:36:31,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 19:36:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3125. [2020-02-10 19:36:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:36:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15566 transitions. [2020-02-10 19:36:32,069 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15566 transitions. Word has length 31 [2020-02-10 19:36:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:32,069 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15566 transitions. [2020-02-10 19:36:32,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15566 transitions. [2020-02-10 19:36:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:32,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:32,074 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 775845860, now seen corresponding path program 312 times [2020-02-10 19:36:32,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:32,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768451233] [2020-02-10 19:36:32,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:32,624 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:32,753 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:32,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768451233] [2020-02-10 19:36:32,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:32,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:32,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413082600] [2020-02-10 19:36:32,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:32,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:32,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:32,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:32,764 INFO L87 Difference]: Start difference. First operand 3125 states and 15566 transitions. Second operand 12 states. [2020-02-10 19:36:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:33,137 INFO L93 Difference]: Finished difference Result 5967 states and 26671 transitions. [2020-02-10 19:36:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:33,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:33,154 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 19:36:33,154 INFO L226 Difference]: Without dead ends: 5933 [2020-02-10 19:36:33,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5933 states. [2020-02-10 19:36:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5933 to 3109. [2020-02-10 19:36:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 19:36:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15532 transitions. [2020-02-10 19:36:33,362 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15532 transitions. Word has length 31 [2020-02-10 19:36:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:33,362 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15532 transitions. [2020-02-10 19:36:33,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15532 transitions. [2020-02-10 19:36:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:33,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:33,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:33,367 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 130856954, now seen corresponding path program 313 times [2020-02-10 19:36:33,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:33,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857418867] [2020-02-10 19:36:33,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:33,917 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:34,096 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:34,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857418867] [2020-02-10 19:36:34,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:34,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:34,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392156867] [2020-02-10 19:36:34,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:34,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:34,107 INFO L87 Difference]: Start difference. First operand 3109 states and 15532 transitions. Second operand 12 states. [2020-02-10 19:36:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:34,420 INFO L93 Difference]: Finished difference Result 5999 states and 26786 transitions. [2020-02-10 19:36:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:34,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:34,435 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 19:36:34,435 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 19:36:34,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 19:36:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3129. [2020-02-10 19:36:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:36:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15599 transitions. [2020-02-10 19:36:34,643 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15599 transitions. Word has length 31 [2020-02-10 19:36:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:34,643 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15599 transitions. [2020-02-10 19:36:34,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15599 transitions. [2020-02-10 19:36:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:34,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:34,649 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1136600224, now seen corresponding path program 314 times [2020-02-10 19:36:34,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:34,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567886763] [2020-02-10 19:36:34,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:35,314 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:35,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567886763] [2020-02-10 19:36:35,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:35,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:35,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171999504] [2020-02-10 19:36:35,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:35,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:35,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:35,324 INFO L87 Difference]: Start difference. First operand 3129 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:36:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:35,676 INFO L93 Difference]: Finished difference Result 6000 states and 26780 transitions. [2020-02-10 19:36:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:35,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:35,691 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 19:36:35,691 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 19:36:35,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 19:36:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3121. [2020-02-10 19:36:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:36:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-02-10 19:36:35,907 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-02-10 19:36:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:35,907 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-02-10 19:36:35,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-02-10 19:36:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:35,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:35,912 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash -293454282, now seen corresponding path program 315 times [2020-02-10 19:36:35,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:35,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15471066] [2020-02-10 19:36:35,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:36,478 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:36,608 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:36,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15471066] [2020-02-10 19:36:36,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:36,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:36,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652856015] [2020-02-10 19:36:36,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:36,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:36,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:36,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:36,619 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:36:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:36,841 INFO L93 Difference]: Finished difference Result 5994 states and 26768 transitions. [2020-02-10 19:36:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:36,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:36,856 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 19:36:36,856 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 19:36:36,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 19:36:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3127. [2020-02-10 19:36:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:36:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15589 transitions. [2020-02-10 19:36:37,064 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15589 transitions. Word has length 31 [2020-02-10 19:36:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:37,064 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15589 transitions. [2020-02-10 19:36:37,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15589 transitions. [2020-02-10 19:36:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:37,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:37,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:37,070 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:37,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:37,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1889084384, now seen corresponding path program 316 times [2020-02-10 19:36:37,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:37,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893916136] [2020-02-10 19:36:37,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:37,611 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:37,742 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:37,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893916136] [2020-02-10 19:36:37,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:37,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:37,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630815801] [2020-02-10 19:36:37,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:37,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:37,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:37,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:37,751 INFO L87 Difference]: Start difference. First operand 3127 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:36:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:37,981 INFO L93 Difference]: Finished difference Result 5992 states and 26758 transitions. [2020-02-10 19:36:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:37,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:37,995 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 19:36:37,995 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 19:36:37,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 19:36:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 19:36:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:36:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15572 transitions. [2020-02-10 19:36:38,202 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15572 transitions. Word has length 31 [2020-02-10 19:36:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:38,202 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15572 transitions. [2020-02-10 19:36:38,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15572 transitions. [2020-02-10 19:36:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:38,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:38,207 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2097588982, now seen corresponding path program 317 times [2020-02-10 19:36:38,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:38,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480856416] [2020-02-10 19:36:38,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:38,753 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:36:38,885 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:38,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480856416] [2020-02-10 19:36:38,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:38,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:38,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481108163] [2020-02-10 19:36:38,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:38,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:38,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:38,895 INFO L87 Difference]: Start difference. First operand 3121 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:36:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:39,116 INFO L93 Difference]: Finished difference Result 5996 states and 26766 transitions. [2020-02-10 19:36:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:39,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:39,131 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 19:36:39,131 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 19:36:39,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 19:36:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-02-10 19:36:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:36:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-02-10 19:36:39,338 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-02-10 19:36:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:39,338 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-02-10 19:36:39,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-02-10 19:36:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:39,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:39,343 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1252617530, now seen corresponding path program 318 times [2020-02-10 19:36:39,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:39,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876823373] [2020-02-10 19:36:39,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:39,892 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:40,023 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:40,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876823373] [2020-02-10 19:36:40,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:40,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:40,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230119553] [2020-02-10 19:36:40,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:40,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:40,034 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:36:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:40,248 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-02-10 19:36:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:40,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:40,264 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 19:36:40,264 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 19:36:40,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 19:36:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3115. [2020-02-10 19:36:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:36:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-02-10 19:36:40,481 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-02-10 19:36:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:40,481 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-02-10 19:36:40,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-02-10 19:36:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:40,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:40,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:40,486 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:40,486 INFO L82 PathProgramCache]: Analyzing trace with hash -137889474, now seen corresponding path program 319 times [2020-02-10 19:36:40,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:40,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97853895] [2020-02-10 19:36:40,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:41,045 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:41,178 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:36:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:41,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97853895] [2020-02-10 19:36:41,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:41,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:41,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796580150] [2020-02-10 19:36:41,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:41,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:41,189 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-02-10 19:36:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:41,439 INFO L93 Difference]: Finished difference Result 6003 states and 26792 transitions. [2020-02-10 19:36:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:41,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:41,454 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 19:36:41,455 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 19:36:41,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 19:36:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3130. [2020-02-10 19:36:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:36:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-02-10 19:36:41,704 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-02-10 19:36:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:41,704 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-02-10 19:36:41,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-02-10 19:36:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:41,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:41,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:41,709 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1405346652, now seen corresponding path program 320 times [2020-02-10 19:36:41,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:41,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706654250] [2020-02-10 19:36:41,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:42,270 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:42,399 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:42,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706654250] [2020-02-10 19:36:42,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:42,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:42,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025545848] [2020-02-10 19:36:42,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:42,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:42,408 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-02-10 19:36:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:42,630 INFO L93 Difference]: Finished difference Result 6004 states and 26786 transitions. [2020-02-10 19:36:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:42,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:42,645 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 19:36:42,645 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 19:36:42,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 19:36:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3122. [2020-02-10 19:36:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:36:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-02-10 19:36:42,860 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-02-10 19:36:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:42,860 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-02-10 19:36:42,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-02-10 19:36:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:42,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:42,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:42,865 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash -986511946, now seen corresponding path program 321 times [2020-02-10 19:36:42,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:42,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716963419] [2020-02-10 19:36:42,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:43,422 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:43,554 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:36:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:43,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716963419] [2020-02-10 19:36:43,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:43,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:43,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862666845] [2020-02-10 19:36:43,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:43,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:43,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:43,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:43,565 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:36:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:43,787 INFO L93 Difference]: Finished difference Result 6000 states and 26778 transitions. [2020-02-10 19:36:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:43,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:43,802 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 19:36:43,803 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 19:36:43,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 19:36:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3129. [2020-02-10 19:36:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:36:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 19:36:44,009 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 19:36:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:44,009 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 19:36:44,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 19:36:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:44,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:44,014 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash 351055268, now seen corresponding path program 322 times [2020-02-10 19:36:44,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:44,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650114899] [2020-02-10 19:36:44,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:44,562 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:44,693 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:44,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650114899] [2020-02-10 19:36:44,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:44,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:44,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691097935] [2020-02-10 19:36:44,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:44,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:44,703 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:36:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:44,937 INFO L93 Difference]: Finished difference Result 5999 states and 26769 transitions. [2020-02-10 19:36:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:44,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:44,952 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 19:36:44,952 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 19:36:44,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 19:36:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3122. [2020-02-10 19:36:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:36:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 19:36:45,164 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 19:36:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:45,164 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 19:36:45,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 19:36:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:45,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:45,170 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1404531318, now seen corresponding path program 323 times [2020-02-10 19:36:45,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:45,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227502397] [2020-02-10 19:36:45,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:45,713 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:45,848 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:45,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227502397] [2020-02-10 19:36:45,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:45,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:45,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445724059] [2020-02-10 19:36:45,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:45,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:45,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:45,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:45,859 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:36:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:46,080 INFO L93 Difference]: Finished difference Result 6002 states and 26775 transitions. [2020-02-10 19:36:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:46,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:46,095 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 19:36:46,095 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 19:36:46,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 19:36:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3129. [2020-02-10 19:36:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:36:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-02-10 19:36:46,311 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-02-10 19:36:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:46,311 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-02-10 19:36:46,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-02-10 19:36:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:46,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:46,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:46,317 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash -285411586, now seen corresponding path program 324 times [2020-02-10 19:36:46,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:46,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742091592] [2020-02-10 19:36:46,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:46,982 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:46,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 19:36:46,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742091592] [2020-02-10 19:36:46,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:46,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:46,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866757100] [2020-02-10 19:36:46,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:46,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:46,993 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-02-10 19:36:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:47,264 INFO L93 Difference]: Finished difference Result 6000 states and 26764 transitions. [2020-02-10 19:36:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:47,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:47,279 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 19:36:47,280 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:36:47,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:36:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3115. [2020-02-10 19:36:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:36:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15549 transitions. [2020-02-10 19:36:47,498 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15549 transitions. Word has length 31 [2020-02-10 19:36:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:47,498 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15549 transitions. [2020-02-10 19:36:47,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15549 transitions. [2020-02-10 19:36:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:47,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:47,503 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash -830947138, now seen corresponding path program 325 times [2020-02-10 19:36:47,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:47,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839320119] [2020-02-10 19:36:47,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:48,044 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:48,173 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:48,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839320119] [2020-02-10 19:36:48,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:48,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:48,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415351295] [2020-02-10 19:36:48,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:48,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:48,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:48,183 INFO L87 Difference]: Start difference. First operand 3115 states and 15549 transitions. Second operand 12 states. [2020-02-10 19:36:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:48,441 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-02-10 19:36:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:48,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:48,455 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 19:36:48,455 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 19:36:48,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 19:36:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 19:36:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:36:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-02-10 19:36:48,666 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-02-10 19:36:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:48,666 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-02-10 19:36:48,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-02-10 19:36:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:48,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:48,672 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1351591528, now seen corresponding path program 326 times [2020-02-10 19:36:48,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:48,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435601093] [2020-02-10 19:36:48,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:49,249 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:49,372 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:36:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:49,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435601093] [2020-02-10 19:36:49,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:49,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:49,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813318513] [2020-02-10 19:36:49,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:49,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:49,383 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:36:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:49,623 INFO L93 Difference]: Finished difference Result 5989 states and 26745 transitions. [2020-02-10 19:36:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:49,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:49,639 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 19:36:49,639 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 19:36:49,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 19:36:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-02-10 19:36:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:36:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15566 transitions. [2020-02-10 19:36:49,858 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15566 transitions. Word has length 31 [2020-02-10 19:36:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:49,858 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15566 transitions. [2020-02-10 19:36:49,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15566 transitions. [2020-02-10 19:36:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:49,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:49,863 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1255258374, now seen corresponding path program 327 times [2020-02-10 19:36:49,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:49,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541634197] [2020-02-10 19:36:49,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:50,413 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:50,548 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:36:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:50,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541634197] [2020-02-10 19:36:50,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:50,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:50,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393194117] [2020-02-10 19:36:50,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:50,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:50,559 INFO L87 Difference]: Start difference. First operand 3121 states and 15566 transitions. Second operand 12 states. [2020-02-10 19:36:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:50,790 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-02-10 19:36:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:50,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:50,806 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 19:36:50,806 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 19:36:50,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 19:36:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-02-10 19:36:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:36:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-02-10 19:36:51,021 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-02-10 19:36:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:51,021 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-02-10 19:36:51,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-02-10 19:36:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:51,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:51,026 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash 82308840, now seen corresponding path program 328 times [2020-02-10 19:36:51,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:51,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952029450] [2020-02-10 19:36:51,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:51,569 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:51,697 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:51,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952029450] [2020-02-10 19:36:51,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:51,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:51,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578588782] [2020-02-10 19:36:51,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:51,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:51,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:51,706 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:36:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:51,978 INFO L93 Difference]: Finished difference Result 5992 states and 26745 transitions. [2020-02-10 19:36:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:51,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:51,994 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 19:36:51,994 INFO L226 Difference]: Without dead ends: 5967 [2020-02-10 19:36:51,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-02-10 19:36:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3121. [2020-02-10 19:36:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:36:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-02-10 19:36:52,209 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-02-10 19:36:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:52,209 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-02-10 19:36:52,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-02-10 19:36:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:52,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:52,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:52,214 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:52,215 INFO L82 PathProgramCache]: Analyzing trace with hash -133497798, now seen corresponding path program 329 times [2020-02-10 19:36:52,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:52,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445666987] [2020-02-10 19:36:52,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:52,763 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:52,892 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:52,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445666987] [2020-02-10 19:36:52,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:52,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:52,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835345618] [2020-02-10 19:36:52,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:52,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:52,902 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:36:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:53,129 INFO L93 Difference]: Finished difference Result 5988 states and 26737 transitions. [2020-02-10 19:36:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:53,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:53,144 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 19:36:53,144 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 19:36:53,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 19:36:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3127. [2020-02-10 19:36:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:36:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15571 transitions. [2020-02-10 19:36:53,359 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15571 transitions. Word has length 31 [2020-02-10 19:36:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:53,359 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15571 transitions. [2020-02-10 19:36:53,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15571 transitions. [2020-02-10 19:36:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:53,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:53,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:53,365 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash -978469250, now seen corresponding path program 330 times [2020-02-10 19:36:53,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:53,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827957041] [2020-02-10 19:36:53,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:53,917 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:36:54,049 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:36:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:54,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827957041] [2020-02-10 19:36:54,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:54,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:54,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758178343] [2020-02-10 19:36:54,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:54,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:54,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:54,059 INFO L87 Difference]: Start difference. First operand 3127 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:36:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:54,300 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-02-10 19:36:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:54,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:54,315 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 19:36:54,315 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 19:36:54,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 19:36:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3115. [2020-02-10 19:36:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:36:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15543 transitions. [2020-02-10 19:36:54,530 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15543 transitions. Word has length 31 [2020-02-10 19:36:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:54,531 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15543 transitions. [2020-02-10 19:36:54,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15543 transitions. [2020-02-10 19:36:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:54,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:54,536 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash -990507164, now seen corresponding path program 331 times [2020-02-10 19:36:54,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:54,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531880397] [2020-02-10 19:36:54,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:55,079 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:55,210 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:55,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531880397] [2020-02-10 19:36:55,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:55,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:55,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673488845] [2020-02-10 19:36:55,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:55,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:55,220 INFO L87 Difference]: Start difference. First operand 3115 states and 15543 transitions. Second operand 12 states. [2020-02-10 19:36:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:55,538 INFO L93 Difference]: Finished difference Result 5994 states and 26755 transitions. [2020-02-10 19:36:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:55,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:55,553 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 19:36:55,553 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 19:36:55,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 19:36:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-02-10 19:36:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:36:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15577 transitions. [2020-02-10 19:36:55,771 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15577 transitions. Word has length 31 [2020-02-10 19:36:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:55,771 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15577 transitions. [2020-02-10 19:36:55,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15577 transitions. [2020-02-10 19:36:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:55,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:55,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:55,776 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1835478616, now seen corresponding path program 332 times [2020-02-10 19:36:55,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:55,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990409402] [2020-02-10 19:36:55,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:56,322 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:36:56,453 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:56,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990409402] [2020-02-10 19:36:56,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:56,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:56,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060300590] [2020-02-10 19:36:56,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:56,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:56,464 INFO L87 Difference]: Start difference. First operand 3127 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:36:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:56,702 INFO L93 Difference]: Finished difference Result 5991 states and 26743 transitions. [2020-02-10 19:36:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:56,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:56,717 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 19:36:56,718 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:36:56,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:36:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 19:36:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:36:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-02-10 19:36:56,970 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-02-10 19:36:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:56,970 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-02-10 19:36:56,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-02-10 19:36:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:56,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:56,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:56,975 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:56,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1414818400, now seen corresponding path program 333 times [2020-02-10 19:36:56,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:56,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907440060] [2020-02-10 19:36:56,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:57,525 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:57,654 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:57,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907440060] [2020-02-10 19:36:57,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:57,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:57,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428726400] [2020-02-10 19:36:57,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:57,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:57,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:57,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:57,665 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:36:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:57,981 INFO L93 Difference]: Finished difference Result 5996 states and 26754 transitions. [2020-02-10 19:36:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:57,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:57,996 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 19:36:57,996 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 19:36:57,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 19:36:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-02-10 19:36:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:36:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 19:36:58,205 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 19:36:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:58,205 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 19:36:58,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 19:36:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:58,210 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36:58,210 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:58,210 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:58,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:58,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1190205992, now seen corresponding path program 334 times [2020-02-10 19:36:58,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:58,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135248329] [2020-02-10 19:36:58,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:58,750 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:36:58,882 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:36:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:36:58,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135248329] [2020-02-10 19:36:58,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:36:58,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:36:58,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760049685] [2020-02-10 19:36:58,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:36:58,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:36:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:36:58,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:36:58,892 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 19:36:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:36:59,141 INFO L93 Difference]: Finished difference Result 5994 states and 26743 transitions. [2020-02-10 19:36:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:36:59,142 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:36:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:36:59,156 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 19:36:59,156 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 19:36:59,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:36:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 19:36:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 19:36:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:36:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15554 transitions. [2020-02-10 19:36:59,373 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15554 transitions. Word has length 31 [2020-02-10 19:36:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:36:59,373 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15554 transitions. [2020-02-10 19:36:59,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:36:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15554 transitions. [2020-02-10 19:36:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:36:59,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:36: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:36:59,378 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:36:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:36:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1610866208, now seen corresponding path program 335 times [2020-02-10 19:36:59,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:36:59,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885840025] [2020-02-10 19:36:59,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:36:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:36:59,919 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:00,053 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:00,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885840025] [2020-02-10 19:37:00,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:00,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:00,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147659862] [2020-02-10 19:37:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:00,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:00,063 INFO L87 Difference]: Start difference. First operand 3121 states and 15554 transitions. Second operand 12 states. [2020-02-10 19:37:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:00,338 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-02-10 19:37:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:00,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:00,354 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 19:37:00,354 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 19:37:00,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 19:37:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 19:37:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15565 transitions. [2020-02-10 19:37:00,574 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15565 transitions. Word has length 31 [2020-02-10 19:37:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:00,575 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15565 transitions. [2020-02-10 19:37:00,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15565 transitions. [2020-02-10 19:37:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:00,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:00,580 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash 765894756, now seen corresponding path program 336 times [2020-02-10 19:37:00,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:00,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000362387] [2020-02-10 19:37:00,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:01,122 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:01,257 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:01,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000362387] [2020-02-10 19:37:01,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:01,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:01,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472104436] [2020-02-10 19:37:01,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:01,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:01,267 INFO L87 Difference]: Start difference. First operand 3127 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:37:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:01,519 INFO L93 Difference]: Finished difference Result 5990 states and 26729 transitions. [2020-02-10 19:37:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:01,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:01,534 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 19:37:01,534 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 19:37:01,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 19:37:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3109. [2020-02-10 19:37:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 19:37:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15527 transitions. [2020-02-10 19:37:01,740 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15527 transitions. Word has length 31 [2020-02-10 19:37:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:01,741 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15527 transitions. [2020-02-10 19:37:01,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15527 transitions. [2020-02-10 19:37:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:01,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:01,746 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -508759942, now seen corresponding path program 337 times [2020-02-10 19:37:01,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:01,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438736770] [2020-02-10 19:37:01,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:02,269 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:02,400 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37: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 19:37:02,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438736770] [2020-02-10 19:37:02,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:02,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:02,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657984683] [2020-02-10 19:37:02,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:02,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:02,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:02,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:02,410 INFO L87 Difference]: Start difference. First operand 3109 states and 15527 transitions. Second operand 12 states. [2020-02-10 19:37:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:02,671 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-02-10 19:37:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:02,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:02,685 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:37:02,685 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 19:37:02,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 19:37:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 19:37:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:37:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 19:37:02,901 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 19:37:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:02,901 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 19:37:02,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 19:37:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:02,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:02,907 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1353731394, now seen corresponding path program 338 times [2020-02-10 19:37:02,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:02,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361449320] [2020-02-10 19:37:02,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:03,443 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:37:03,573 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:03,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361449320] [2020-02-10 19:37:03,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:03,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:03,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574360109] [2020-02-10 19:37:03,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:03,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:03,583 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:37:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:03,794 INFO L93 Difference]: Finished difference Result 5972 states and 26696 transitions. [2020-02-10 19:37:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:03,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:03,810 INFO L225 Difference]: With dead ends: 5972 [2020-02-10 19:37:03,810 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:37:03,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:37:04,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 19:37:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:37:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 19:37:04,023 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 19:37:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:04,023 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 19:37:04,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 19:37:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:04,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:04,029 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:04,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -933071178, now seen corresponding path program 339 times [2020-02-10 19:37:04,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:04,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563516844] [2020-02-10 19:37:04,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:04,568 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:04,742 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:04,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 19:37:04,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563516844] [2020-02-10 19:37:04,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:04,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:04,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131516123] [2020-02-10 19:37:04,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:04,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:04,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:04,752 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:37:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:04,965 INFO L93 Difference]: Finished difference Result 5965 states and 26682 transitions. [2020-02-10 19:37:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:04,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:04,979 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 19:37:04,980 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 19:37:04,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 19:37:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-02-10 19:37:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:37:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 19:37:05,195 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 19:37:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:05,195 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 19:37:05,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 19:37:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:05,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:05,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:05,201 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1671953214, now seen corresponding path program 340 times [2020-02-10 19:37:05,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:05,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623457036] [2020-02-10 19:37:05,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:05,872 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:05,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623457036] [2020-02-10 19:37:05,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:05,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:05,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372274765] [2020-02-10 19:37:05,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:05,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:05,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:05,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:05,882 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:37:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:06,118 INFO L93 Difference]: Finished difference Result 5966 states and 26679 transitions. [2020-02-10 19:37:06,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:06,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:06,132 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 19:37:06,133 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 19:37:06,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 19:37:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-02-10 19:37:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:37:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 19:37:06,340 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 19:37:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:06,340 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 19:37:06,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 19:37:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:06,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:06,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:06,345 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2092613430, now seen corresponding path program 341 times [2020-02-10 19:37:06,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:06,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771247549] [2020-02-10 19:37:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:06,875 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:07,006 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:07,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 19:37:07,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771247549] [2020-02-10 19:37:07,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:07,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:07,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138773941] [2020-02-10 19:37:07,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:07,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:07,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:07,016 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:37:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:07,278 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-02-10 19:37:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:07,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:07,293 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:37:07,293 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 19:37:07,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 19:37:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-02-10 19:37:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:37:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 19:37:07,508 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 19:37:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:07,509 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 19:37:07,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 19:37:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:07,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:07,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:07,514 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1247641978, now seen corresponding path program 342 times [2020-02-10 19:37:07,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:07,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981109633] [2020-02-10 19:37:07,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:08,044 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:08,175 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:08,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981109633] [2020-02-10 19:37:08,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:08,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:08,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053444293] [2020-02-10 19:37:08,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:08,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:08,185 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:37:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:08,490 INFO L93 Difference]: Finished difference Result 5971 states and 26684 transitions. [2020-02-10 19:37:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:08,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:08,505 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 19:37:08,506 INFO L226 Difference]: Without dead ends: 5943 [2020-02-10 19:37:08,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-02-10 19:37:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3114. [2020-02-10 19:37:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:37:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-02-10 19:37:08,720 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-02-10 19:37:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:08,721 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-02-10 19:37:08,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-02-10 19:37:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:08,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:08,726 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash -777506370, now seen corresponding path program 343 times [2020-02-10 19:37:08,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:08,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463692514] [2020-02-10 19:37:08,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:09,256 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:09,390 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37: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 19:37:09,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463692514] [2020-02-10 19:37:09,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:09,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:09,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388204050] [2020-02-10 19:37:09,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:09,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:09,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:09,400 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-02-10 19:37:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:09,641 INFO L93 Difference]: Finished difference Result 5970 states and 26693 transitions. [2020-02-10 19:37:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:09,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:09,655 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 19:37:09,656 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 19:37:09,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 19:37:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-02-10 19:37:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:37:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 19:37:09,871 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 19:37:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:09,871 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 19:37:09,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 19:37:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:09,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:09,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:09,876 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:09,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1622477822, now seen corresponding path program 344 times [2020-02-10 19:37:09,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:09,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540544917] [2020-02-10 19:37:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:10,404 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:10,541 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:10,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540544917] [2020-02-10 19:37:10,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:10,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:10,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260027671] [2020-02-10 19:37:10,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:10,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:10,551 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:37:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:10,843 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-02-10 19:37:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:10,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:10,857 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 19:37:10,857 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 19:37:10,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 19:37:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-02-10 19:37:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:37:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 19:37:11,073 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 19:37:11,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:11,073 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 19:37:11,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 19:37:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:11,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:11,079 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1626128842, now seen corresponding path program 345 times [2020-02-10 19:37:11,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:11,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321832287] [2020-02-10 19:37:11,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:11,619 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:11,750 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37:11,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 19:37:11,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321832287] [2020-02-10 19:37:11,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:11,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:11,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153689408] [2020-02-10 19:37:11,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:11,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:11,760 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:37:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:12,056 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-02-10 19:37:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:12,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:12,070 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:37:12,070 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 19:37:12,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 19:37:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 19:37:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:37:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 19:37:12,349 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 19:37:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:12,349 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 19:37:12,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 19:37:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:12,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:12,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:12,355 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash 133924098, now seen corresponding path program 346 times [2020-02-10 19:37:12,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:12,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055559879] [2020-02-10 19:37:12,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:12,886 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:37:13,012 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:13,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055559879] [2020-02-10 19:37:13,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:13,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:13,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703671485] [2020-02-10 19:37:13,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:13,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:13,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:13,023 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:37:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:13,259 INFO L93 Difference]: Finished difference Result 5970 states and 26683 transitions. [2020-02-10 19:37:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:13,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:13,274 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 19:37:13,274 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:37:13,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:37:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 19:37:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:37:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 19:37:13,487 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 19:37:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:13,487 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 19:37:13,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 19:37:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:13,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:13,493 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:13,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:13,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1399555766, now seen corresponding path program 347 times [2020-02-10 19:37:13,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:13,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375813600] [2020-02-10 19:37:13,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:14,020 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:14,152 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:14,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375813600] [2020-02-10 19:37:14,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:14,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:14,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694423476] [2020-02-10 19:37:14,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:14,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:14,162 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 19:37:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:14,412 INFO L93 Difference]: Finished difference Result 5978 states and 26701 transitions. [2020-02-10 19:37:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:14,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:14,426 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 19:37:14,426 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 19:37:14,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 19:37:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-02-10 19:37:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:37:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-02-10 19:37:14,648 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-02-10 19:37:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:14,649 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-02-10 19:37:14,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-02-10 19:37:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:14,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:14,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:14,654 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash -290387138, now seen corresponding path program 348 times [2020-02-10 19:37:14,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:14,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009168408] [2020-02-10 19:37:14,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:15,187 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:37:15,326 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:15,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009168408] [2020-02-10 19:37:15,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:15,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:15,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241997999] [2020-02-10 19:37:15,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:15,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:15,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:15,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:15,336 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:37:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:15,592 INFO L93 Difference]: Finished difference Result 5976 states and 26690 transitions. [2020-02-10 19:37:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:15,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:15,605 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 19:37:15,606 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 19:37:15,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 19:37:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3114. [2020-02-10 19:37:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:37:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15541 transitions. [2020-02-10 19:37:15,821 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15541 transitions. Word has length 31 [2020-02-10 19:37:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:15,821 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15541 transitions. [2020-02-10 19:37:15,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15541 transitions. [2020-02-10 19:37:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:15,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:15,827 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1470564034, now seen corresponding path program 349 times [2020-02-10 19:37:15,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:15,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714647250] [2020-02-10 19:37:15,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:16,376 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:16,506 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:16,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714647250] [2020-02-10 19:37:16,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:16,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:16,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497214715] [2020-02-10 19:37:16,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:16,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:16,515 INFO L87 Difference]: Start difference. First operand 3114 states and 15541 transitions. Second operand 12 states. [2020-02-10 19:37:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:16,813 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 19:37:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:16,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:16,828 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 19:37:16,828 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 19:37:16,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 19:37:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 19:37:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:37:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 19:37:17,043 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 19:37:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:17,043 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 19:37:17,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 19:37:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:17,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:17,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:17,048 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:17,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1134460358, now seen corresponding path program 350 times [2020-02-10 19:37:17,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:17,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920299010] [2020-02-10 19:37:17,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:17,587 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:17,718 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:17,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 19:37:17,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920299010] [2020-02-10 19:37:17,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:17,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:17,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102465639] [2020-02-10 19:37:17,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:17,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:17,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:17,729 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:37:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:18,002 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-02-10 19:37:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:18,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:18,018 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 19:37:18,018 INFO L226 Difference]: Without dead ends: 5942 [2020-02-10 19:37:18,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-02-10 19:37:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-02-10 19:37:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:37:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 19:37:18,227 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 19:37:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:18,227 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 19:37:18,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 19:37:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:18,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:18,232 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1894875270, now seen corresponding path program 351 times [2020-02-10 19:37:18,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:18,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772149715] [2020-02-10 19:37:18,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:18,772 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:18,905 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:18,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772149715] [2020-02-10 19:37:18,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:18,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:18,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617806266] [2020-02-10 19:37:18,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:18,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:18,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:18,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:18,914 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 19:37:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:19,164 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-02-10 19:37:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:19,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:19,178 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 19:37:19,179 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 19:37:19,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 19:37:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3124. [2020-02-10 19:37:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:37:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15564 transitions. [2020-02-10 19:37:19,387 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15564 transitions. Word has length 31 [2020-02-10 19:37:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:19,387 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15564 transitions. [2020-02-10 19:37:19,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15564 transitions. [2020-02-10 19:37:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:19,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:19,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:19,392 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash -134822330, now seen corresponding path program 352 times [2020-02-10 19:37:19,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:19,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244247293] [2020-02-10 19:37:19,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:19,921 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:37:20,053 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:37:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:20,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244247293] [2020-02-10 19:37:20,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:20,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:20,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605671478] [2020-02-10 19:37:20,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:20,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:20,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:20,064 INFO L87 Difference]: Start difference. First operand 3124 states and 15564 transitions. Second operand 12 states. [2020-02-10 19:37:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:20,445 INFO L93 Difference]: Finished difference Result 5966 states and 26669 transitions. [2020-02-10 19:37:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:20,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:20,461 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 19:37:20,461 INFO L226 Difference]: Without dead ends: 5943 [2020-02-10 19:37:20,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-02-10 19:37:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3119. [2020-02-10 19:37:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:37:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15550 transitions. [2020-02-10 19:37:20,668 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15550 transitions. Word has length 31 [2020-02-10 19:37:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:20,669 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15550 transitions. [2020-02-10 19:37:20,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15550 transitions. [2020-02-10 19:37:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:20,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:20,674 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:20,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:20,674 INFO L82 PathProgramCache]: Analyzing trace with hash -138473350, now seen corresponding path program 353 times [2020-02-10 19:37:20,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:20,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690544394] [2020-02-10 19:37:20,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:21,208 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:21,336 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:21,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690544394] [2020-02-10 19:37:21,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:21,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:21,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695558787] [2020-02-10 19:37:21,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:21,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:21,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:21,347 INFO L87 Difference]: Start difference. First operand 3119 states and 15550 transitions. Second operand 12 states. [2020-02-10 19:37:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:21,597 INFO L93 Difference]: Finished difference Result 5967 states and 26672 transitions. [2020-02-10 19:37:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:21,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:21,613 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 19:37:21,613 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 19:37:21,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 19:37:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3125. [2020-02-10 19:37:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:37:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15561 transitions. [2020-02-10 19:37:21,828 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15561 transitions. Word has length 31 [2020-02-10 19:37:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:21,828 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15561 transitions. [2020-02-10 19:37:21,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15561 transitions. [2020-02-10 19:37:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:21,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:21,834 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -983444802, now seen corresponding path program 354 times [2020-02-10 19:37:21,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:21,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375980681] [2020-02-10 19:37:21,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:22,375 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:22,530 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:22,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375980681] [2020-02-10 19:37:22,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:22,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:22,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982442347] [2020-02-10 19:37:22,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:22,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:22,541 INFO L87 Difference]: Start difference. First operand 3125 states and 15561 transitions. Second operand 12 states. [2020-02-10 19:37:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:22,892 INFO L93 Difference]: Finished difference Result 5968 states and 26668 transitions. [2020-02-10 19:37:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:22,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:22,908 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 19:37:22,909 INFO L226 Difference]: Without dead ends: 5939 [2020-02-10 19:37:22,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2020-02-10 19:37:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 3114. [2020-02-10 19:37:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 19:37:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15536 transitions. [2020-02-10 19:37:23,118 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15536 transitions. Word has length 31 [2020-02-10 19:37:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:23,118 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15536 transitions. [2020-02-10 19:37:23,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15536 transitions. [2020-02-10 19:37:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:23,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:23,123 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1286374146, now seen corresponding path program 355 times [2020-02-10 19:37:23,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:23,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830172461] [2020-02-10 19:37:23,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:23,649 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:23,778 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:23,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830172461] [2020-02-10 19:37:23,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:23,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:23,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56573270] [2020-02-10 19:37:23,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:23,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:23,788 INFO L87 Difference]: Start difference. First operand 3114 states and 15536 transitions. Second operand 12 states. [2020-02-10 19:37:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:24,145 INFO L93 Difference]: Finished difference Result 5980 states and 26708 transitions. [2020-02-10 19:37:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:24,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:24,160 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:37:24,160 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 19:37:24,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 19:37:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3126. [2020-02-10 19:37:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:37:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15570 transitions. [2020-02-10 19:37:24,368 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15570 transitions. Word has length 31 [2020-02-10 19:37:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:24,368 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15570 transitions. [2020-02-10 19:37:24,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15570 transitions. [2020-02-10 19:37:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:24,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:24,374 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash 441402694, now seen corresponding path program 356 times [2020-02-10 19:37:24,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:24,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332646986] [2020-02-10 19:37:24,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:24,894 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:25,025 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:25,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332646986] [2020-02-10 19:37:25,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:25,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:25,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250497869] [2020-02-10 19:37:25,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:25,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:25,035 INFO L87 Difference]: Start difference. First operand 3126 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:37:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:25,298 INFO L93 Difference]: Finished difference Result 5977 states and 26696 transitions. [2020-02-10 19:37:25,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:25,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:25,313 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 19:37:25,313 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 19:37:25,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 19:37:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3120. [2020-02-10 19:37:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:37:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15553 transitions. [2020-02-10 19:37:25,520 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15553 transitions. Word has length 31 [2020-02-10 19:37:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:25,521 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15553 transitions. [2020-02-10 19:37:25,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15553 transitions. [2020-02-10 19:37:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:25,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:25,526 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash 862062910, now seen corresponding path program 357 times [2020-02-10 19:37:25,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:25,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175634483] [2020-02-10 19:37:25,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:26,194 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:26,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175634483] [2020-02-10 19:37:26,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:26,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:26,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779847552] [2020-02-10 19:37:26,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:26,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:26,204 INFO L87 Difference]: Start difference. First operand 3120 states and 15553 transitions. Second operand 12 states. [2020-02-10 19:37:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:26,422 INFO L93 Difference]: Finished difference Result 5982 states and 26707 transitions. [2020-02-10 19:37:26,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:26,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:26,437 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 19:37:26,437 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 19:37:26,437 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 19:37:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3127. [2020-02-10 19:37:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15566 transitions. [2020-02-10 19:37:26,652 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15566 transitions. Word has length 31 [2020-02-10 19:37:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:26,652 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15566 transitions. [2020-02-10 19:37:26,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15566 transitions. [2020-02-10 19:37:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:26,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:26,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:26,658 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:26,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash -827879994, now seen corresponding path program 358 times [2020-02-10 19:37:26,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:26,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123477922] [2020-02-10 19:37:26,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:27,193 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:27,322 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37: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 19:37:27,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123477922] [2020-02-10 19:37:27,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:27,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:27,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202032522] [2020-02-10 19:37:27,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:27,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:27,332 INFO L87 Difference]: Start difference. First operand 3127 states and 15566 transitions. Second operand 12 states. [2020-02-10 19:37:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:27,570 INFO L93 Difference]: Finished difference Result 5980 states and 26696 transitions. [2020-02-10 19:37:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:27,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:27,585 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:37:27,585 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 19:37:27,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 19:37:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3120. [2020-02-10 19:37:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:37:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15547 transitions. [2020-02-10 19:37:27,801 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15547 transitions. Word has length 31 [2020-02-10 19:37:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:27,801 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15547 transitions. [2020-02-10 19:37:27,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15547 transitions. [2020-02-10 19:37:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:27,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:27,807 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash -407219778, now seen corresponding path program 359 times [2020-02-10 19:37:27,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:27,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436309954] [2020-02-10 19:37:27,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:28,425 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:28,557 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:28,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 19:37:28,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436309954] [2020-02-10 19:37:28,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:28,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:28,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333717] [2020-02-10 19:37:28,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:28,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:28,566 INFO L87 Difference]: Start difference. First operand 3120 states and 15547 transitions. Second operand 12 states. [2020-02-10 19:37:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:28,781 INFO L93 Difference]: Finished difference Result 5975 states and 26686 transitions. [2020-02-10 19:37:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:28,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:28,796 INFO L225 Difference]: With dead ends: 5975 [2020-02-10 19:37:28,796 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 19:37:28,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 19:37:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-02-10 19:37:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:37:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15558 transitions. [2020-02-10 19:37:29,002 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15558 transitions. Word has length 31 [2020-02-10 19:37:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:29,003 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15558 transitions. [2020-02-10 19:37:29,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15558 transitions. [2020-02-10 19:37:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:29,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:29,008 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:29,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:29,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1252191230, now seen corresponding path program 360 times [2020-02-10 19:37:29,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:29,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587498034] [2020-02-10 19:37:29,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:29,550 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:29,682 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:29,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587498034] [2020-02-10 19:37:29,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:29,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:29,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879612399] [2020-02-10 19:37:29,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:29,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:29,693 INFO L87 Difference]: Start difference. First operand 3126 states and 15558 transitions. Second operand 12 states. [2020-02-10 19:37:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:29,919 INFO L93 Difference]: Finished difference Result 5976 states and 26682 transitions. [2020-02-10 19:37:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:29,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:29,935 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 19:37:29,935 INFO L226 Difference]: Without dead ends: 5936 [2020-02-10 19:37:29,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2020-02-10 19:37:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 3104. [2020-02-10 19:37:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 19:37:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15513 transitions. [2020-02-10 19:37:30,148 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15513 transitions. Word has length 31 [2020-02-10 19:37:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:30,148 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15513 transitions. [2020-02-10 19:37:30,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15513 transitions. [2020-02-10 19:37:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:30,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:30,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:30,153 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1612839400, now seen corresponding path program 361 times [2020-02-10 19:37:30,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:30,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451840450] [2020-02-10 19:37:30,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:30,813 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:30,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451840450] [2020-02-10 19:37:30,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:30,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:30,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456812257] [2020-02-10 19:37:30,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:30,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:30,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:30,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:30,823 INFO L87 Difference]: Start difference. First operand 3104 states and 15513 transitions. Second operand 12 states. [2020-02-10 19:37:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:31,061 INFO L93 Difference]: Finished difference Result 6011 states and 26822 transitions. [2020-02-10 19:37:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:31,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:31,077 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 19:37:31,077 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:37:31,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:37:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-02-10 19:37:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15606 transitions. [2020-02-10 19:37:31,295 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15606 transitions. Word has length 31 [2020-02-10 19:37:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:31,295 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15606 transitions. [2020-02-10 19:37:31,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15606 transitions. [2020-02-10 19:37:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:31,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:31,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:31,301 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:31,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1190353674, now seen corresponding path program 362 times [2020-02-10 19:37:31,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:31,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331983344] [2020-02-10 19:37:31,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:31,837 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:37:31,971 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:31,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331983344] [2020-02-10 19:37:31,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:31,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:31,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606802217] [2020-02-10 19:37:31,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:31,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:31,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:31,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:31,981 INFO L87 Difference]: Start difference. First operand 3127 states and 15606 transitions. Second operand 12 states. [2020-02-10 19:37:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:32,209 INFO L93 Difference]: Finished difference Result 6008 states and 26811 transitions. [2020-02-10 19:37:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:32,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:32,224 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 19:37:32,224 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 19:37:32,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 19:37:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-02-10 19:37:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:37:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15592 transitions. [2020-02-10 19:37:32,432 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15592 transitions. Word has length 31 [2020-02-10 19:37:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:32,432 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15592 transitions. [2020-02-10 19:37:32,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15592 transitions. [2020-02-10 19:37:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:32,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:32,438 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:32,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1188528164, now seen corresponding path program 363 times [2020-02-10 19:37:32,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:32,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352711926] [2020-02-10 19:37:32,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:32,982 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:33,118 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:33,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352711926] [2020-02-10 19:37:33,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:33,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:33,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969316814] [2020-02-10 19:37:33,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:33,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:33,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:33,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:33,128 INFO L87 Difference]: Start difference. First operand 3122 states and 15592 transitions. Second operand 12 states. [2020-02-10 19:37:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:33,377 INFO L93 Difference]: Finished difference Result 6018 states and 26834 transitions. [2020-02-10 19:37:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:33,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:33,392 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 19:37:33,392 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 19:37:33,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:33,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 19:37:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3130. [2020-02-10 19:37:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:37:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-02-10 19:37:33,600 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-02-10 19:37:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:33,601 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-02-10 19:37:33,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-02-10 19:37:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:33,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:33,606 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:33,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -78929014, now seen corresponding path program 364 times [2020-02-10 19:37:33,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:33,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525225640] [2020-02-10 19:37:33,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:34,143 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:34,274 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:34,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525225640] [2020-02-10 19:37:34,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:34,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:34,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906026044] [2020-02-10 19:37:34,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:34,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:34,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:34,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:34,284 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:37:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:34,521 INFO L93 Difference]: Finished difference Result 6019 states and 26828 transitions. [2020-02-10 19:37:34,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:34,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:34,535 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 19:37:34,536 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 19:37:34,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 19:37:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3122. [2020-02-10 19:37:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:37:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-02-10 19:37:34,744 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-02-10 19:37:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:34,744 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-02-10 19:37:34,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-02-10 19:37:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:34,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:34,750 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 553886820, now seen corresponding path program 365 times [2020-02-10 19:37:34,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:34,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743559379] [2020-02-10 19:37:34,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:35,285 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:35,411 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:35,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743559379] [2020-02-10 19:37:35,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:35,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:35,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846565382] [2020-02-10 19:37:35,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:35,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:35,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:35,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:35,421 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:37:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:35,645 INFO L93 Difference]: Finished difference Result 6009 states and 26808 transitions. [2020-02-10 19:37:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:35,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:35,659 INFO L225 Difference]: With dead ends: 6009 [2020-02-10 19:37:35,659 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 19:37:35,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 19:37:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3127. [2020-02-10 19:37:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15596 transitions. [2020-02-10 19:37:35,917 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15596 transitions. Word has length 31 [2020-02-10 19:37:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:35,917 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15596 transitions. [2020-02-10 19:37:35,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15596 transitions. [2020-02-10 19:37:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:35,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:35,923 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash -291084632, now seen corresponding path program 366 times [2020-02-10 19:37:35,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:35,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089677377] [2020-02-10 19:37:35,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:36,443 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:36,574 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:36,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089677377] [2020-02-10 19:37:36,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:36,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:36,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930421320] [2020-02-10 19:37:36,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:36,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:36,584 INFO L87 Difference]: Start difference. First operand 3127 states and 15596 transitions. Second operand 12 states. [2020-02-10 19:37:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:36,849 INFO L93 Difference]: Finished difference Result 6013 states and 26811 transitions. [2020-02-10 19:37:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:36,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:36,865 INFO L225 Difference]: With dead ends: 6013 [2020-02-10 19:37:36,866 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 19:37:36,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 19:37:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3117. [2020-02-10 19:37:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 19:37:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15573 transitions. [2020-02-10 19:37:37,086 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15573 transitions. Word has length 31 [2020-02-10 19:37:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:37,086 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15573 transitions. [2020-02-10 19:37:37,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15573 transitions. [2020-02-10 19:37:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:37,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:37,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:37,094 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:37,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:37,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1344092972, now seen corresponding path program 367 times [2020-02-10 19:37:37,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:37,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253182715] [2020-02-10 19:37:37,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:37,625 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:37,749 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:37,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253182715] [2020-02-10 19:37:37,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:37,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:37,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642184229] [2020-02-10 19:37:37,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:37,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:37,759 INFO L87 Difference]: Start difference. First operand 3117 states and 15573 transitions. Second operand 12 states. [2020-02-10 19:37:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:37,985 INFO L93 Difference]: Finished difference Result 6006 states and 26805 transitions. [2020-02-10 19:37:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:37,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:38,001 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 19:37:38,002 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 19:37:38,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 19:37:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3127. [2020-02-10 19:37:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-02-10 19:37:38,217 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-02-10 19:37:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:38,217 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-02-10 19:37:38,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-02-10 19:37:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:38,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:38,223 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:38,223 INFO L82 PathProgramCache]: Analyzing trace with hash 921607246, now seen corresponding path program 368 times [2020-02-10 19:37:38,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:38,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735048208] [2020-02-10 19:37:38,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:38,752 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:37:38,882 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735048208] [2020-02-10 19:37:38,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:38,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:38,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452641773] [2020-02-10 19:37:38,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:38,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:38,892 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:37:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:39,119 INFO L93 Difference]: Finished difference Result 6003 states and 26794 transitions. [2020-02-10 19:37:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:39,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:39,134 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 19:37:39,134 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 19:37:39,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 19:37:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 19:37:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:37:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-02-10 19:37:39,350 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-02-10 19:37:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:39,350 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-02-10 19:37:39,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-02-10 19:37:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:39,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:39,356 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:39,356 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash 495470500, now seen corresponding path program 369 times [2020-02-10 19:37:39,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:39,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387106638] [2020-02-10 19:37:39,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:39,884 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:37:40,012 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:37:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:40,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387106638] [2020-02-10 19:37:40,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:40,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:40,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912342476] [2020-02-10 19:37:40,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:40,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:40,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:40,023 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:37:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:40,258 INFO L93 Difference]: Finished difference Result 6008 states and 26805 transitions. [2020-02-10 19:37:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:40,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:40,273 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 19:37:40,274 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 19:37:40,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 19:37:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3128. [2020-02-10 19:37:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:37:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 19:37:40,480 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 19:37:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:40,481 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 19:37:40,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 19:37:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:40,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:40,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:40,486 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:40,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1616958130, now seen corresponding path program 370 times [2020-02-10 19:37:40,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:40,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327498060] [2020-02-10 19:37:40,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:41,147 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:37:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:41,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327498060] [2020-02-10 19:37:41,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:41,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:41,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871906276] [2020-02-10 19:37:41,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:41,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:41,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:41,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:41,158 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:37:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:41,414 INFO L93 Difference]: Finished difference Result 6006 states and 26795 transitions. [2020-02-10 19:37:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:41,415 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:41,430 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 19:37:41,430 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 19:37:41,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 19:37:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-02-10 19:37:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:37:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-02-10 19:37:41,642 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-02-10 19:37:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:41,642 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-02-10 19:37:41,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-02-10 19:37:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:41,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:41,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:41,648 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash -139170844, now seen corresponding path program 371 times [2020-02-10 19:37:41,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:41,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473088963] [2020-02-10 19:37:41,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:42,185 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:37:42,316 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:42,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473088963] [2020-02-10 19:37:42,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:42,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:42,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502628717] [2020-02-10 19:37:42,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:42,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:42,326 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:37:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:42,555 INFO L93 Difference]: Finished difference Result 6001 states and 26785 transitions. [2020-02-10 19:37:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:42,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:42,571 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 19:37:42,571 INFO L226 Difference]: Without dead ends: 5985 [2020-02-10 19:37:42,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-02-10 19:37:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3127. [2020-02-10 19:37:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-02-10 19:37:42,786 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-02-10 19:37:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:42,786 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-02-10 19:37:42,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-02-10 19:37:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:42,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:42,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:42,792 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1829113748, now seen corresponding path program 372 times [2020-02-10 19:37:42,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:42,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105336513] [2020-02-10 19:37:42,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:43,336 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:37:43,469 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:37:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:43,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105336513] [2020-02-10 19:37:43,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:43,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:43,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491817526] [2020-02-10 19:37:43,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:43,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:43,480 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-02-10 19:37:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:43,739 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-02-10 19:37:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:43,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:43,754 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 19:37:43,754 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 19:37:43,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 19:37:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3117. [2020-02-10 19:37:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 19:37:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15568 transitions. [2020-02-10 19:37:43,961 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15568 transitions. Word has length 31 [2020-02-10 19:37:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:43,962 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15568 transitions. [2020-02-10 19:37:43,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15568 transitions. [2020-02-10 19:37:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:43,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:43,967 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 651035308, now seen corresponding path program 373 times [2020-02-10 19:37:43,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:43,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648267588] [2020-02-10 19:37:43,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:44,511 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:37:44,645 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:37:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:44,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648267588] [2020-02-10 19:37:44,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:44,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:44,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038517646] [2020-02-10 19:37:44,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:44,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:44,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:44,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:44,657 INFO L87 Difference]: Start difference. First operand 3117 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:37:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:44,973 INFO L93 Difference]: Finished difference Result 6022 states and 26841 transitions. [2020-02-10 19:37:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:44,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:44,989 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 19:37:44,989 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 19:37:44,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 19:37:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3131. [2020-02-10 19:37:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:37:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15606 transitions. [2020-02-10 19:37:45,197 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15606 transitions. Word has length 31 [2020-02-10 19:37:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:45,197 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15606 transitions. [2020-02-10 19:37:45,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15606 transitions. [2020-02-10 19:37:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:45,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:45,202 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash -616421870, now seen corresponding path program 374 times [2020-02-10 19:37:45,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:45,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358099577] [2020-02-10 19:37:45,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:45,747 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:45,877 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:45,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358099577] [2020-02-10 19:37:45,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:45,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:45,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480188926] [2020-02-10 19:37:45,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:45,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:45,887 INFO L87 Difference]: Start difference. First operand 3131 states and 15606 transitions. Second operand 12 states. [2020-02-10 19:37:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:46,132 INFO L93 Difference]: Finished difference Result 6023 states and 26835 transitions. [2020-02-10 19:37:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:46,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:46,147 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 19:37:46,147 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 19:37:46,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 19:37:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3123. [2020-02-10 19:37:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:37:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-02-10 19:37:46,356 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-02-10 19:37:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:46,357 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-02-10 19:37:46,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-02-10 19:37:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:46,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:46,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:46,363 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:46,363 INFO L82 PathProgramCache]: Analyzing trace with hash 226724072, now seen corresponding path program 375 times [2020-02-10 19:37:46,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:46,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197402867] [2020-02-10 19:37:46,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:47,033 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:37:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:47,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197402867] [2020-02-10 19:37:47,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:47,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:47,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647431677] [2020-02-10 19:37:47,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:47,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:47,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:47,044 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:37:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:47,284 INFO L93 Difference]: Finished difference Result 6017 states and 26823 transitions. [2020-02-10 19:37:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:47,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:47,300 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 19:37:47,300 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:37:47,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:37:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 19:37:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:37:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15596 transitions. [2020-02-10 19:37:47,517 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15596 transitions. Word has length 31 [2020-02-10 19:37:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:47,518 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15596 transitions. [2020-02-10 19:37:47,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15596 transitions. [2020-02-10 19:37:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:47,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:47,523 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:47,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:47,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1885704558, now seen corresponding path program 376 times [2020-02-10 19:37:47,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:47,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691125334] [2020-02-10 19:37:47,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:48,058 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:37:48,193 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:37:48,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 19:37:48,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691125334] [2020-02-10 19:37:48,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:48,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:48,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277181751] [2020-02-10 19:37:48,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:48,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:48,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:48,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:48,203 INFO L87 Difference]: Start difference. First operand 3129 states and 15596 transitions. Second operand 12 states. [2020-02-10 19:37:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:48,444 INFO L93 Difference]: Finished difference Result 6015 states and 26813 transitions. [2020-02-10 19:37:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:48,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:48,459 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 19:37:48,459 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:37:48,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:37:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 19:37:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:37:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-02-10 19:37:48,669 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-02-10 19:37:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:48,669 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-02-10 19:37:48,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-02-10 19:37:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:48,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:48,674 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1677199960, now seen corresponding path program 377 times [2020-02-10 19:37:48,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:48,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159245433] [2020-02-10 19:37:48,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:49,204 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:49,336 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:49,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159245433] [2020-02-10 19:37:49,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:49,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:49,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097893640] [2020-02-10 19:37:49,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:49,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:49,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:49,346 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:37:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:49,589 INFO L93 Difference]: Finished difference Result 6019 states and 26821 transitions. [2020-02-10 19:37:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:49,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:49,604 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 19:37:49,605 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 19:37:49,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 19:37:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3129. [2020-02-10 19:37:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:37:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15590 transitions. [2020-02-10 19:37:49,813 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15590 transitions. Word has length 31 [2020-02-10 19:37:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:49,814 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15590 transitions. [2020-02-10 19:37:49,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15590 transitions. [2020-02-10 19:37:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:49,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:49,819 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1772795884, now seen corresponding path program 378 times [2020-02-10 19:37:49,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:49,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638205970] [2020-02-10 19:37:49,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:50,360 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:50,495 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:50,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638205970] [2020-02-10 19:37:50,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:50,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:50,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81479799] [2020-02-10 19:37:50,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:50,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:50,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:50,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:50,507 INFO L87 Difference]: Start difference. First operand 3129 states and 15590 transitions. Second operand 12 states. [2020-02-10 19:37:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:50,799 INFO L93 Difference]: Finished difference Result 6016 states and 26809 transitions. [2020-02-10 19:37:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:50,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:50,815 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 19:37:50,815 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 19:37:50,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 19:37:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3117. [2020-02-10 19:37:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 19:37:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15563 transitions. [2020-02-10 19:37:51,024 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15563 transitions. Word has length 31 [2020-02-10 19:37:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:51,024 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15563 transitions. [2020-02-10 19:37:51,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15563 transitions. [2020-02-10 19:37:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:51,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:51,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:51,029 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2029504398, now seen corresponding path program 379 times [2020-02-10 19:37:51,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:51,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054559832] [2020-02-10 19:37:51,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:51,603 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:51,736 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:51,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 19:37:51,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054559832] [2020-02-10 19:37:51,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:51,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:51,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269692110] [2020-02-10 19:37:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:51,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:51,746 INFO L87 Difference]: Start difference. First operand 3117 states and 15563 transitions. Second operand 12 states. [2020-02-10 19:37:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:51,974 INFO L93 Difference]: Finished difference Result 6005 states and 26793 transitions. [2020-02-10 19:37:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:51,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:51,990 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 19:37:51,990 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 19:37:51,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 19:37:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-02-10 19:37:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-02-10 19:37:52,197 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-02-10 19:37:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:52,197 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-02-10 19:37:52,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-02-10 19:37:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:52,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:52,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:52,203 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1184532946, now seen corresponding path program 380 times [2020-02-10 19:37:52,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:52,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453706493] [2020-02-10 19:37:52,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:52,740 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:37:52,870 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:52,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453706493] [2020-02-10 19:37:52,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:52,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:52,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196834374] [2020-02-10 19:37:52,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:52,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:52,881 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-02-10 19:37:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:53,105 INFO L93 Difference]: Finished difference Result 6009 states and 26796 transitions. [2020-02-10 19:37:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:53,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:53,119 INFO L225 Difference]: With dead ends: 6009 [2020-02-10 19:37:53,119 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 19:37:53,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 19:37:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-02-10 19:37:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:37:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15577 transitions. [2020-02-10 19:37:53,327 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15577 transitions. Word has length 31 [2020-02-10 19:37:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:53,327 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15577 transitions. [2020-02-10 19:37:53,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15577 transitions. [2020-02-10 19:37:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:53,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:53,332 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1605193162, now seen corresponding path program 381 times [2020-02-10 19:37:53,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:53,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588102336] [2020-02-10 19:37:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:53,878 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:37:54,011 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:37:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:54,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588102336] [2020-02-10 19:37:54,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:54,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:54,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747642687] [2020-02-10 19:37:54,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:54,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:54,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:54,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:54,021 INFO L87 Difference]: Start difference. First operand 3122 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:37:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:54,298 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-02-10 19:37:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:54,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:54,312 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 19:37:54,312 INFO L226 Difference]: Without dead ends: 5986 [2020-02-10 19:37:54,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-02-10 19:37:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3127. [2020-02-10 19:37:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:37:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15586 transitions. [2020-02-10 19:37:54,524 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15586 transitions. Word has length 31 [2020-02-10 19:37:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:54,524 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15586 transitions. [2020-02-10 19:37:54,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15586 transitions. [2020-02-10 19:37:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:54,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:54,529 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -84749742, now seen corresponding path program 382 times [2020-02-10 19:37:54,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:54,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226901421] [2020-02-10 19:37:54,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:55,075 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:55,205 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:55,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226901421] [2020-02-10 19:37:55,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:55,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:55,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253024054] [2020-02-10 19:37:55,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:55,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:55,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:55,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:55,215 INFO L87 Difference]: Start difference. First operand 3127 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:37:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:55,461 INFO L93 Difference]: Finished difference Result 6003 states and 26779 transitions. [2020-02-10 19:37:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:55,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:55,477 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 19:37:55,477 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 19:37:55,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 19:37:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3122. [2020-02-10 19:37:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:37:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15572 transitions. [2020-02-10 19:37:55,698 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15572 transitions. Word has length 31 [2020-02-10 19:37:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:55,698 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15572 transitions. [2020-02-10 19:37:55,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15572 transitions. [2020-02-10 19:37:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:55,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:55,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:55,703 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash 335910474, now seen corresponding path program 383 times [2020-02-10 19:37:55,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:55,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895703598] [2020-02-10 19:37:55,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:56,368 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:56,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895703598] [2020-02-10 19:37:56,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:56,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:56,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36185082] [2020-02-10 19:37:56,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:56,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:56,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:56,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:56,378 INFO L87 Difference]: Start difference. First operand 3122 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:37:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:56,618 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-02-10 19:37:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:56,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:56,634 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 19:37:56,634 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 19:37:56,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 19:37:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3128. [2020-02-10 19:37:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:37:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 19:37:56,853 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 19:37:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:56,853 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 19:37:56,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 19:37:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:56,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:56,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:56,858 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:56,859 INFO L82 PathProgramCache]: Analyzing trace with hash -509060978, now seen corresponding path program 384 times [2020-02-10 19:37:56,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:56,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161514031] [2020-02-10 19:37:56,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:57,402 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:37:57,535 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:57,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161514031] [2020-02-10 19:37:57,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:57,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:57,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113094530] [2020-02-10 19:37:57,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:57,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:57,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:57,544 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:37:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:57,847 INFO L93 Difference]: Finished difference Result 6008 states and 26784 transitions. [2020-02-10 19:37:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:57,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:57,862 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 19:37:57,862 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 19:37:57,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 19:37:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3112. [2020-02-10 19:37:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 19:37:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15549 transitions. [2020-02-10 19:37:58,079 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15549 transitions. Word has length 31 [2020-02-10 19:37:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:58,080 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15549 transitions. [2020-02-10 19:37:58,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15549 transitions. [2020-02-10 19:37:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:58,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:58,085 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:58,085 INFO L82 PathProgramCache]: Analyzing trace with hash 112344062, now seen corresponding path program 385 times [2020-02-10 19:37:58,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:58,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430708942] [2020-02-10 19:37:58,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:58,755 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:37:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:37:58,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430708942] [2020-02-10 19:37:58,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:37:58,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:37:58,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792845773] [2020-02-10 19:37:58,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:37:58,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:37:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:37:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:37:58,766 INFO L87 Difference]: Start difference. First operand 3112 states and 15549 transitions. Second operand 12 states. [2020-02-10 19:37:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:37:59,059 INFO L93 Difference]: Finished difference Result 6036 states and 26879 transitions. [2020-02-10 19:37:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:37:59,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:37:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:37:59,075 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:37:59,075 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 19:37:59,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:37:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 19:37:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-02-10 19:37:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:37:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15610 transitions. [2020-02-10 19:37:59,338 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15610 transitions. Word has length 31 [2020-02-10 19:37:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:37:59,338 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15610 transitions. [2020-02-10 19:37:59,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:37:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15610 transitions. [2020-02-10 19:37:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:37:59,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:37:59,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:37:59,344 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:37:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:37:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -310141664, now seen corresponding path program 386 times [2020-02-10 19:37:59,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:37:59,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564759433] [2020-02-10 19:37:59,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:37:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:37:59,892 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:38:00,025 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:38:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:00,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564759433] [2020-02-10 19:38:00,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:00,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:00,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564983007] [2020-02-10 19:38:00,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:00,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:00,035 INFO L87 Difference]: Start difference. First operand 3130 states and 15610 transitions. Second operand 12 states. [2020-02-10 19:38:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:00,281 INFO L93 Difference]: Finished difference Result 6033 states and 26868 transitions. [2020-02-10 19:38:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:00,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:00,296 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 19:38:00,297 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:38:00,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:38:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-02-10 19:38:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:38:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15596 transitions. [2020-02-10 19:38:00,517 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15596 transitions. Word has length 31 [2020-02-10 19:38:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:00,517 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15596 transitions. [2020-02-10 19:38:00,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15596 transitions. [2020-02-10 19:38:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:00,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:00,522 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash -311967174, now seen corresponding path program 387 times [2020-02-10 19:38:00,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:00,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957579345] [2020-02-10 19:38:00,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:01,068 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:38:01,199 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:38:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:01,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957579345] [2020-02-10 19:38:01,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:01,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:01,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058984245] [2020-02-10 19:38:01,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:01,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:01,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:01,209 INFO L87 Difference]: Start difference. First operand 3125 states and 15596 transitions. Second operand 12 states. [2020-02-10 19:38:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:01,529 INFO L93 Difference]: Finished difference Result 6043 states and 26891 transitions. [2020-02-10 19:38:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:01,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:01,545 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 19:38:01,545 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 19:38:01,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 19:38:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3133. [2020-02-10 19:38:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:38:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15611 transitions. [2020-02-10 19:38:01,752 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15611 transitions. Word has length 31 [2020-02-10 19:38:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:01,752 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15611 transitions. [2020-02-10 19:38:01,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15611 transitions. [2020-02-10 19:38:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:01,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:01,757 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:01,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:01,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1579424352, now seen corresponding path program 388 times [2020-02-10 19:38:01,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:01,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673297723] [2020-02-10 19:38:01,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:02,300 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:02,431 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:02,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673297723] [2020-02-10 19:38:02,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:02,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:02,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441511992] [2020-02-10 19:38:02,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:02,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:02,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:02,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:02,442 INFO L87 Difference]: Start difference. First operand 3133 states and 15611 transitions. Second operand 12 states. [2020-02-10 19:38:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:02,693 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-02-10 19:38:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:02,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:02,708 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 19:38:02,708 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:38:02,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:38:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-02-10 19:38:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:38:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 19:38:02,916 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 19:38:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:02,917 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 19:38:02,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 19:38:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:02,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:02,922 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:02,922 INFO L82 PathProgramCache]: Analyzing trace with hash -946608518, now seen corresponding path program 389 times [2020-02-10 19:38:02,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:02,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479176097] [2020-02-10 19:38:02,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:03,463 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:03,594 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:03,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479176097] [2020-02-10 19:38:03,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:03,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:03,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968889865] [2020-02-10 19:38:03,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:03,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:03,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:03,605 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 19:38:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:03,848 INFO L93 Difference]: Finished difference Result 6034 states and 26865 transitions. [2020-02-10 19:38:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:03,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:03,863 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 19:38:03,863 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 19:38:03,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 19:38:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-02-10 19:38:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:38:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15600 transitions. [2020-02-10 19:38:04,070 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15600 transitions. Word has length 31 [2020-02-10 19:38:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:04,070 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15600 transitions. [2020-02-10 19:38:04,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15600 transitions. [2020-02-10 19:38:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:04,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:04,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:04,076 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1791579970, now seen corresponding path program 390 times [2020-02-10 19:38:04,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:04,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961539214] [2020-02-10 19:38:04,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:04,615 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:04,747 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:04,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961539214] [2020-02-10 19:38:04,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:04,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:04,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233679555] [2020-02-10 19:38:04,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:04,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:04,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:04,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:04,758 INFO L87 Difference]: Start difference. First operand 3130 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:38:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:05,064 INFO L93 Difference]: Finished difference Result 6038 states and 26868 transitions. [2020-02-10 19:38:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:05,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:05,079 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 19:38:05,079 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 19:38:05,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 19:38:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3120. [2020-02-10 19:38:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:38:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-02-10 19:38:05,297 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-02-10 19:38:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:05,297 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-02-10 19:38:05,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-02-10 19:38:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:05,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:05,302 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:05,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1319215212, now seen corresponding path program 391 times [2020-02-10 19:38:05,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:05,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510382286] [2020-02-10 19:38:05,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:05,838 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:38:05,968 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:05,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510382286] [2020-02-10 19:38:05,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:05,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:05,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18807605] [2020-02-10 19:38:05,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:05,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:05,978 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:38:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:06,286 INFO L93 Difference]: Finished difference Result 6041 states and 26884 transitions. [2020-02-10 19:38:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:06,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:06,301 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 19:38:06,302 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 19:38:06,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 19:38:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-02-10 19:38:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:38:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15608 transitions. [2020-02-10 19:38:06,509 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15608 transitions. Word has length 31 [2020-02-10 19:38:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:06,509 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15608 transitions. [2020-02-10 19:38:06,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15608 transitions. [2020-02-10 19:38:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:06,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:06,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:06,514 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash 896729486, now seen corresponding path program 392 times [2020-02-10 19:38:06,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:06,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816038110] [2020-02-10 19:38:06,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:07,052 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:07,229 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:07,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816038110] [2020-02-10 19:38:07,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:07,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:07,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898460012] [2020-02-10 19:38:07,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:07,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:07,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:07,239 INFO L87 Difference]: Start difference. First operand 3131 states and 15608 transitions. Second operand 12 states. [2020-02-10 19:38:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:07,522 INFO L93 Difference]: Finished difference Result 6038 states and 26873 transitions. [2020-02-10 19:38:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:07,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:07,536 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 19:38:07,536 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 19:38:07,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 19:38:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3126. [2020-02-10 19:38:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:38:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15594 transitions. [2020-02-10 19:38:07,746 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15594 transitions. Word has length 31 [2020-02-10 19:38:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:07,746 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15594 transitions. [2020-02-10 19:38:07,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15594 transitions. [2020-02-10 19:38:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:07,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:07,751 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -590185350, now seen corresponding path program 393 times [2020-02-10 19:38:07,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:07,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219893549] [2020-02-10 19:38:07,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:08,288 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:38:08,422 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:08,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219893549] [2020-02-10 19:38:08,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:08,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:08,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074407049] [2020-02-10 19:38:08,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:08,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:08,432 INFO L87 Difference]: Start difference. First operand 3126 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:38:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:08,713 INFO L93 Difference]: Finished difference Result 6051 states and 26901 transitions. [2020-02-10 19:38:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:08,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:08,728 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:38:08,728 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 19:38:08,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 19:38:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3135. [2020-02-10 19:38:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:38:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-02-10 19:38:08,943 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-02-10 19:38:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:08,944 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-02-10 19:38:08,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-02-10 19:38:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:08,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:08,949 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:08,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash -520075314, now seen corresponding path program 394 times [2020-02-10 19:38:08,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:08,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147580699] [2020-02-10 19:38:08,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:09,500 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:09,633 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:09,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147580699] [2020-02-10 19:38:09,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:09,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:09,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553369544] [2020-02-10 19:38:09,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:09,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:09,643 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-02-10 19:38:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:09,912 INFO L93 Difference]: Finished difference Result 6054 states and 26898 transitions. [2020-02-10 19:38:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:09,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:09,927 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:38:09,927 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 19:38:09,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 19:38:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3126. [2020-02-10 19:38:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:38:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 19:38:10,135 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 19:38:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:10,135 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 19:38:10,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 19:38:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:10,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:10,140 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:10,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1224826694, now seen corresponding path program 395 times [2020-02-10 19:38:10,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:10,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749467076] [2020-02-10 19:38:10,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:10,671 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:10,804 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:10,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749467076] [2020-02-10 19:38:10,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:10,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:10,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333670761] [2020-02-10 19:38:10,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:10,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:10,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:10,813 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:38:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:11,172 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-02-10 19:38:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:11,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:11,187 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 19:38:11,187 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:38:11,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:38:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3132. [2020-02-10 19:38:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:38:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15599 transitions. [2020-02-10 19:38:11,394 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15599 transitions. Word has length 31 [2020-02-10 19:38:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:11,394 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15599 transitions. [2020-02-10 19:38:11,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15599 transitions. [2020-02-10 19:38:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:11,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:11,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:11,400 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash -732230932, now seen corresponding path program 396 times [2020-02-10 19:38:11,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:11,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284930957] [2020-02-10 19:38:11,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:11,932 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:12,063 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:12,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284930957] [2020-02-10 19:38:12,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:12,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:12,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498503149] [2020-02-10 19:38:12,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:12,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:12,073 INFO L87 Difference]: Start difference. First operand 3132 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:38:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:12,399 INFO L93 Difference]: Finished difference Result 6048 states and 26880 transitions. [2020-02-10 19:38:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:12,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:12,413 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 19:38:12,413 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 19:38:12,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 19:38:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3120. [2020-02-10 19:38:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:38:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15571 transitions. [2020-02-10 19:38:12,621 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15571 transitions. Word has length 31 [2020-02-10 19:38:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:12,622 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15571 transitions. [2020-02-10 19:38:12,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15571 transitions. [2020-02-10 19:38:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:12,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:12,627 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash 626157548, now seen corresponding path program 397 times [2020-02-10 19:38:12,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:12,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618152173] [2020-02-10 19:38:12,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:13,188 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:38:13,316 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:38:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:13,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618152173] [2020-02-10 19:38:13,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:13,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:13,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998159904] [2020-02-10 19:38:13,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:13,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:13,327 INFO L87 Difference]: Start difference. First operand 3120 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:38:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:13,624 INFO L93 Difference]: Finished difference Result 6065 states and 26940 transitions. [2020-02-10 19:38:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:13,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:13,639 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 19:38:13,639 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 19:38:13,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 19:38:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3139. [2020-02-10 19:38:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 19:38:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15623 transitions. [2020-02-10 19:38:13,855 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15623 transitions. Word has length 31 [2020-02-10 19:38:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:13,855 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15623 transitions. [2020-02-10 19:38:13,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15623 transitions. [2020-02-10 19:38:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:13,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:13,861 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -641299630, now seen corresponding path program 398 times [2020-02-10 19:38:13,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:13,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833510606] [2020-02-10 19:38:13,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:14,419 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:14,554 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:14,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833510606] [2020-02-10 19:38:14,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:14,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:14,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209772817] [2020-02-10 19:38:14,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:14,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:14,563 INFO L87 Difference]: Start difference. First operand 3139 states and 15623 transitions. Second operand 12 states. [2020-02-10 19:38:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:14,929 INFO L93 Difference]: Finished difference Result 6066 states and 26934 transitions. [2020-02-10 19:38:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:14,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:14,944 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 19:38:14,944 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:38:14,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:38:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3131. [2020-02-10 19:38:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:38:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15600 transitions. [2020-02-10 19:38:15,214 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15600 transitions. Word has length 31 [2020-02-10 19:38:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:15,214 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15600 transitions. [2020-02-10 19:38:15,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15600 transitions. [2020-02-10 19:38:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:15,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:15,220 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -858931778, now seen corresponding path program 399 times [2020-02-10 19:38:15,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:15,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446421746] [2020-02-10 19:38:15,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:15,761 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:38:15,892 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38: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 19:38:15,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446421746] [2020-02-10 19:38:15,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:15,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:15,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957780629] [2020-02-10 19:38:15,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:15,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:15,903 INFO L87 Difference]: Start difference. First operand 3131 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:38:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:16,185 INFO L93 Difference]: Finished difference Result 6068 states and 26937 transitions. [2020-02-10 19:38:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:16,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:16,201 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 19:38:16,201 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 19:38:16,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 19:38:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3140. [2020-02-10 19:38:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:38:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15617 transitions. [2020-02-10 19:38:16,416 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15617 transitions. Word has length 31 [2020-02-10 19:38:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:16,416 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15617 transitions. [2020-02-10 19:38:16,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15617 transitions. [2020-02-10 19:38:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:16,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:16,422 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash -788821742, now seen corresponding path program 400 times [2020-02-10 19:38:16,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:16,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983700246] [2020-02-10 19:38:16,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:16,983 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:17,116 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:17,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983700246] [2020-02-10 19:38:17,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:17,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:17,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390892061] [2020-02-10 19:38:17,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:17,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:17,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:17,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:17,126 INFO L87 Difference]: Start difference. First operand 3140 states and 15617 transitions. Second operand 12 states. [2020-02-10 19:38:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:17,309 INFO L93 Difference]: Finished difference Result 6071 states and 26934 transitions. [2020-02-10 19:38:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:17,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:17,325 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 19:38:17,325 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 19:38:17,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 19:38:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3131. [2020-02-10 19:38:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:38:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-02-10 19:38:17,542 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-02-10 19:38:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:17,542 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-02-10 19:38:17,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-02-10 19:38:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:17,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:17,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:17,547 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1532111486, now seen corresponding path program 401 times [2020-02-10 19:38:17,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:17,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025993459] [2020-02-10 19:38:17,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:18,232 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:18,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025993459] [2020-02-10 19:38:18,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:18,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:18,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6418099] [2020-02-10 19:38:18,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:18,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:18,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:18,243 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-02-10 19:38:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:18,470 INFO L93 Difference]: Finished difference Result 6072 states and 26936 transitions. [2020-02-10 19:38:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:18,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:18,485 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 19:38:18,486 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 19:38:18,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 19:38:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3142. [2020-02-10 19:38:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 19:38:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15611 transitions. [2020-02-10 19:38:18,695 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15611 transitions. Word has length 31 [2020-02-10 19:38:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:18,695 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15611 transitions. [2020-02-10 19:38:18,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15611 transitions. [2020-02-10 19:38:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:18,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:18,700 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1425288596, now seen corresponding path program 402 times [2020-02-10 19:38:18,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:18,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606165713] [2020-02-10 19:38:18,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:19,285 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 19:38:19,414 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:38:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:19,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606165713] [2020-02-10 19:38:19,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:19,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:19,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306196658] [2020-02-10 19:38:19,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:19,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:19,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:19,424 INFO L87 Difference]: Start difference. First operand 3142 states and 15611 transitions. Second operand 12 states. [2020-02-10 19:38:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:19,615 INFO L93 Difference]: Finished difference Result 6074 states and 26930 transitions. [2020-02-10 19:38:19,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:19,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:19,630 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 19:38:19,630 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:38:19,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:38:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3120. [2020-02-10 19:38:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:38:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15563 transitions. [2020-02-10 19:38:19,837 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15563 transitions. Word has length 31 [2020-02-10 19:38:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:19,838 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15563 transitions. [2020-02-10 19:38:19,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15563 transitions. [2020-02-10 19:38:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:19,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:19,843 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2004626638, now seen corresponding path program 403 times [2020-02-10 19:38:19,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:19,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319166837] [2020-02-10 19:38:19,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:20,375 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:20,503 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:20,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319166837] [2020-02-10 19:38:20,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:20,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:20,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397847250] [2020-02-10 19:38:20,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:20,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:20,514 INFO L87 Difference]: Start difference. First operand 3120 states and 15563 transitions. Second operand 12 states. [2020-02-10 19:38:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:20,772 INFO L93 Difference]: Finished difference Result 6043 states and 26874 transitions. [2020-02-10 19:38:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:20,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:20,788 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 19:38:20,788 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 19:38:20,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 19:38:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3132. [2020-02-10 19:38:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:38:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-02-10 19:38:21,002 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-02-10 19:38:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:21,003 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-02-10 19:38:21,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-02-10 19:38:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:21,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:21,008 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1159655186, now seen corresponding path program 404 times [2020-02-10 19:38:21,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:21,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846529522] [2020-02-10 19:38:21,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:21,532 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:21,663 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:21,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846529522] [2020-02-10 19:38:21,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:21,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:21,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108771125] [2020-02-10 19:38:21,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:21,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:21,674 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-02-10 19:38:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:21,926 INFO L93 Difference]: Finished difference Result 6047 states and 26877 transitions. [2020-02-10 19:38:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:21,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:21,941 INFO L225 Difference]: With dead ends: 6047 [2020-02-10 19:38:21,941 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 19:38:21,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 19:38:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-02-10 19:38:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:38:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-02-10 19:38:22,158 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-02-10 19:38:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:22,158 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-02-10 19:38:22,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-02-10 19:38:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:22,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:22,163 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:22,163 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash 519537312, now seen corresponding path program 405 times [2020-02-10 19:38:22,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:22,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780956956] [2020-02-10 19:38:22,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:22,705 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:22,840 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:38:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:22,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780956956] [2020-02-10 19:38:22,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:22,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:22,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399554916] [2020-02-10 19:38:22,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:22,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:22,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:22,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:22,850 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:38:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:23,075 INFO L93 Difference]: Finished difference Result 6046 states and 26874 transitions. [2020-02-10 19:38:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:23,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:23,090 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 19:38:23,090 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:38:23,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:38:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3133. [2020-02-10 19:38:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:38:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15593 transitions. [2020-02-10 19:38:23,337 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15593 transitions. Word has length 31 [2020-02-10 19:38:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:23,337 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15593 transitions. [2020-02-10 19:38:23,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15593 transitions. [2020-02-10 19:38:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:23,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:23,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:23,342 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1012133074, now seen corresponding path program 406 times [2020-02-10 19:38:23,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:23,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081454857] [2020-02-10 19:38:23,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:23,873 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 19:38:24,007 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:38:24,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 19:38:24,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081454857] [2020-02-10 19:38:24,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:24,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:24,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554349738] [2020-02-10 19:38:24,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:24,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:24,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:24,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:24,017 INFO L87 Difference]: Start difference. First operand 3133 states and 15593 transitions. Second operand 12 states. [2020-02-10 19:38:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:24,259 INFO L93 Difference]: Finished difference Result 6052 states and 26880 transitions. [2020-02-10 19:38:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:24,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:24,273 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 19:38:24,273 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 19:38:24,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 19:38:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3127. [2020-02-10 19:38:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:38:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-02-10 19:38:24,482 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-02-10 19:38:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:24,483 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-02-10 19:38:24,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-02-10 19:38:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:24,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:24,488 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash -749745376, now seen corresponding path program 407 times [2020-02-10 19:38:24,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:24,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304449128] [2020-02-10 19:38:24,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:25,046 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:38:25,180 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:38:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:25,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304449128] [2020-02-10 19:38:25,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:25,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:25,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821069447] [2020-02-10 19:38:25,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:25,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:25,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:25,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:25,190 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:38:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:25,473 INFO L93 Difference]: Finished difference Result 6059 states and 26897 transitions. [2020-02-10 19:38:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:25,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:25,489 INFO L225 Difference]: With dead ends: 6059 [2020-02-10 19:38:25,489 INFO L226 Difference]: Without dead ends: 6039 [2020-02-10 19:38:25,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2020-02-10 19:38:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 3138. [2020-02-10 19:38:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:38:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15596 transitions. [2020-02-10 19:38:25,705 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15596 transitions. Word has length 31 [2020-02-10 19:38:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:25,705 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15596 transitions. [2020-02-10 19:38:25,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15596 transitions. [2020-02-10 19:38:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:25,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:25,710 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash 587821838, now seen corresponding path program 408 times [2020-02-10 19:38:25,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:25,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488720851] [2020-02-10 19:38:25,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:26,278 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 19:38:26,407 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:38:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:26,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488720851] [2020-02-10 19:38:26,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:26,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:26,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121360881] [2020-02-10 19:38:26,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:26,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:26,416 INFO L87 Difference]: Start difference. First operand 3138 states and 15596 transitions. Second operand 12 states. [2020-02-10 19:38:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:26,605 INFO L93 Difference]: Finished difference Result 6061 states and 26891 transitions. [2020-02-10 19:38:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:26,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:26,620 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:38:26,620 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 19:38:26,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 19:38:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3112. [2020-02-10 19:38:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 19:38:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15541 transitions. [2020-02-10 19:38:26,829 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15541 transitions. Word has length 31 [2020-02-10 19:38:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:26,829 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15541 transitions. [2020-02-10 19:38:26,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15541 transitions. [2020-02-10 19:38:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:26,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:26,834 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 102392958, now seen corresponding path program 409 times [2020-02-10 19:38:26,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:26,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729033630] [2020-02-10 19:38:26,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:27,376 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:38:27,510 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:27,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729033630] [2020-02-10 19:38:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:27,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:27,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266001194] [2020-02-10 19:38:27,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:27,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:27,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:27,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:27,521 INFO L87 Difference]: Start difference. First operand 3112 states and 15541 transitions. Second operand 12 states. [2020-02-10 19:38:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:27,747 INFO L93 Difference]: Finished difference Result 6015 states and 26819 transitions. [2020-02-10 19:38:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:27,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:27,761 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 19:38:27,761 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 19:38:27,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 19:38:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-02-10 19:38:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:38:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15597 transitions. [2020-02-10 19:38:27,968 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15597 transitions. Word has length 31 [2020-02-10 19:38:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:27,968 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15597 transitions. [2020-02-10 19:38:27,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15597 transitions. [2020-02-10 19:38:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:27,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:27,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:27,974 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash -320092768, now seen corresponding path program 410 times [2020-02-10 19:38:27,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:27,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157754897] [2020-02-10 19:38:27,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:28,517 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:28,645 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:28,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157754897] [2020-02-10 19:38:28,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:28,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:28,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297324231] [2020-02-10 19:38:28,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:28,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:28,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:28,655 INFO L87 Difference]: Start difference. First operand 3128 states and 15597 transitions. Second operand 12 states. [2020-02-10 19:38:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:28,884 INFO L93 Difference]: Finished difference Result 6012 states and 26808 transitions. [2020-02-10 19:38:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:28,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:28,899 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 19:38:28,899 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 19:38:28,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 19:38:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3123. [2020-02-10 19:38:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:38:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15583 transitions. [2020-02-10 19:38:29,113 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15583 transitions. Word has length 31 [2020-02-10 19:38:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:29,114 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15583 transitions. [2020-02-10 19:38:29,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15583 transitions. [2020-02-10 19:38:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:29,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:29,119 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -746229514, now seen corresponding path program 411 times [2020-02-10 19:38:29,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:29,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957455011] [2020-02-10 19:38:29,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:29,657 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:38:29,789 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:29,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957455011] [2020-02-10 19:38:29,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:29,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:29,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45504343] [2020-02-10 19:38:29,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:29,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:29,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:29,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:29,799 INFO L87 Difference]: Start difference. First operand 3123 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:38:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:30,032 INFO L93 Difference]: Finished difference Result 6017 states and 26819 transitions. [2020-02-10 19:38:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:30,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:30,046 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 19:38:30,046 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:38:30,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:38:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 19:38:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:38:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-02-10 19:38:30,262 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-02-10 19:38:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:30,262 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-02-10 19:38:30,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-02-10 19:38:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:30,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:30,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:30,267 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1436309152, now seen corresponding path program 412 times [2020-02-10 19:38:30,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:30,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630344560] [2020-02-10 19:38:30,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:30,809 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:30,941 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:30,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630344560] [2020-02-10 19:38:30,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:30,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:30,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132760553] [2020-02-10 19:38:30,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:30,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:30,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:30,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:30,950 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:38:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:31,222 INFO L93 Difference]: Finished difference Result 6015 states and 26809 transitions. [2020-02-10 19:38:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:31,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:31,237 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 19:38:31,238 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:38:31,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:38:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 19:38:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:38:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15578 transitions. [2020-02-10 19:38:31,453 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15578 transitions. Word has length 31 [2020-02-10 19:38:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:31,453 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15578 transitions. [2020-02-10 19:38:31,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15578 transitions. [2020-02-10 19:38:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:31,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:31,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:31,458 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:31,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1380870858, now seen corresponding path program 413 times [2020-02-10 19:38:31,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:31,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473737621] [2020-02-10 19:38:31,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:31,999 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:32,127 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:32,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473737621] [2020-02-10 19:38:32,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:32,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:32,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198767782] [2020-02-10 19:38:32,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:32,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:32,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:32,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:32,136 INFO L87 Difference]: Start difference. First operand 3123 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:38:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:32,357 INFO L93 Difference]: Finished difference Result 6010 states and 26799 transitions. [2020-02-10 19:38:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:32,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:32,373 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 19:38:32,373 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 19:38:32,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 19:38:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-02-10 19:38:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:38:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15587 transitions. [2020-02-10 19:38:32,587 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15587 transitions. Word has length 31 [2020-02-10 19:38:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:32,587 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15587 transitions. [2020-02-10 19:38:32,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15587 transitions. [2020-02-10 19:38:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:32,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:32,593 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1224153534, now seen corresponding path program 414 times [2020-02-10 19:38:32,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:32,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751000390] [2020-02-10 19:38:32,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:33,136 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:33,268 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:33,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 19:38:33,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751000390] [2020-02-10 19:38:33,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:33,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:33,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148746964] [2020-02-10 19:38:33,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:33,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:33,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:33,279 INFO L87 Difference]: Start difference. First operand 3128 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:38:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:33,561 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-02-10 19:38:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:33,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:33,575 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 19:38:33,576 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 19:38:33,576 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 19:38:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3118. [2020-02-10 19:38:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 19:38:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15564 transitions. [2020-02-10 19:38:33,784 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15564 transitions. Word has length 31 [2020-02-10 19:38:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:33,785 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15564 transitions. [2020-02-10 19:38:33,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15564 transitions. [2020-02-10 19:38:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:33,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:33,790 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1578010536, now seen corresponding path program 415 times [2020-02-10 19:38:33,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:33,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762679326] [2020-02-10 19:38:33,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:34,323 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:38:34,453 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:34,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762679326] [2020-02-10 19:38:34,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:34,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:34,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910386584] [2020-02-10 19:38:34,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:34,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:34,463 INFO L87 Difference]: Start difference. First operand 3118 states and 15564 transitions. Second operand 12 states. [2020-02-10 19:38:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:34,695 INFO L93 Difference]: Finished difference Result 6025 states and 26836 transitions. [2020-02-10 19:38:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:34,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:34,710 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 19:38:34,710 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:38:34,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:38:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3129. [2020-02-10 19:38:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:38:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-02-10 19:38:34,920 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-02-10 19:38:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:34,920 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-02-10 19:38:34,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-02-10 19:38:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:34,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:34,925 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1155524810, now seen corresponding path program 416 times [2020-02-10 19:38:34,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:34,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950061625] [2020-02-10 19:38:34,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:35,453 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:35,583 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:35,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950061625] [2020-02-10 19:38:35,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:35,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:35,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580558330] [2020-02-10 19:38:35,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:35,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:35,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:35,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:35,594 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:38:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:35,913 INFO L93 Difference]: Finished difference Result 6022 states and 26825 transitions. [2020-02-10 19:38:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:35,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:35,928 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 19:38:35,928 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:38:35,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:38:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 19:38:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:38:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15581 transitions. [2020-02-10 19:38:36,145 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15581 transitions. Word has length 31 [2020-02-10 19:38:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:36,145 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15581 transitions. [2020-02-10 19:38:36,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15581 transitions. [2020-02-10 19:38:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:36,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:36,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:36,151 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:36,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash -331390026, now seen corresponding path program 417 times [2020-02-10 19:38:36,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:36,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664036030] [2020-02-10 19:38:36,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:36,811 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:36,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664036030] [2020-02-10 19:38:36,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:36,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:36,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257875250] [2020-02-10 19:38:36,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:36,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:36,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:36,821 INFO L87 Difference]: Start difference. First operand 3124 states and 15581 transitions. Second operand 12 states. [2020-02-10 19:38:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:37,066 INFO L93 Difference]: Finished difference Result 6035 states and 26853 transitions. [2020-02-10 19:38:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:37,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:37,081 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 19:38:37,081 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:38:37,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:38:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-02-10 19:38:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:38:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-02-10 19:38:37,297 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-02-10 19:38:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:37,297 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-02-10 19:38:37,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-02-10 19:38:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:37,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:37,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:37,303 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -261279990, now seen corresponding path program 418 times [2020-02-10 19:38:37,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:37,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397588968] [2020-02-10 19:38:37,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:37,854 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:37,983 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:37,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 19:38:37,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397588968] [2020-02-10 19:38:37,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:37,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:37,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555965815] [2020-02-10 19:38:37,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:37,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:37,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:37,993 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-02-10 19:38:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:38,207 INFO L93 Difference]: Finished difference Result 6038 states and 26850 transitions. [2020-02-10 19:38:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:38,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:38,222 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 19:38:38,222 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 19:38:38,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 19:38:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-02-10 19:38:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:38:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15575 transitions. [2020-02-10 19:38:38,440 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15575 transitions. Word has length 31 [2020-02-10 19:38:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:38,441 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15575 transitions. [2020-02-10 19:38:38,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15575 transitions. [2020-02-10 19:38:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:38,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:38,446 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash -966031370, now seen corresponding path program 419 times [2020-02-10 19:38:38,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:38,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639578633] [2020-02-10 19:38:38,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:38,978 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:39,156 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:39,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639578633] [2020-02-10 19:38:39,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:39,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:39,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998161810] [2020-02-10 19:38:39,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:39,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:39,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:39,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:39,167 INFO L87 Difference]: Start difference. First operand 3124 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:38:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:39,473 INFO L93 Difference]: Finished difference Result 6026 states and 26826 transitions. [2020-02-10 19:38:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:39,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:39,488 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 19:38:39,489 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 19:38:39,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 19:38:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3130. [2020-02-10 19:38:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:38:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-02-10 19:38:39,695 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-02-10 19:38:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:39,696 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-02-10 19:38:39,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-02-10 19:38:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:39,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:39,701 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:39,701 INFO L82 PathProgramCache]: Analyzing trace with hash -473435608, now seen corresponding path program 420 times [2020-02-10 19:38:39,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:39,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545083003] [2020-02-10 19:38:39,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:40,227 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:40,358 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:40,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545083003] [2020-02-10 19:38:40,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:40,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:40,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076388030] [2020-02-10 19:38:40,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:40,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:40,369 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:38:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:40,628 INFO L93 Difference]: Finished difference Result 6032 states and 26832 transitions. [2020-02-10 19:38:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:40,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:40,644 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 19:38:40,644 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:38:40,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:38:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3118. [2020-02-10 19:38:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 19:38:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15558 transitions. [2020-02-10 19:38:40,854 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15558 transitions. Word has length 31 [2020-02-10 19:38:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:40,854 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15558 transitions. [2020-02-10 19:38:40,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15558 transitions. [2020-02-10 19:38:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:40,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:40,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:40,859 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:40,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:40,859 INFO L82 PathProgramCache]: Analyzing trace with hash 191895208, now seen corresponding path program 421 times [2020-02-10 19:38:40,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:40,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49892585] [2020-02-10 19:38:40,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:41,391 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:38:41,520 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:41,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49892585] [2020-02-10 19:38:41,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:41,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:41,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77019482] [2020-02-10 19:38:41,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:41,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:41,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:41,530 INFO L87 Difference]: Start difference. First operand 3118 states and 15558 transitions. Second operand 12 states. [2020-02-10 19:38:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:41,773 INFO L93 Difference]: Finished difference Result 6031 states and 26847 transitions. [2020-02-10 19:38:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:41,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:41,788 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 19:38:41,789 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:38:41,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:38:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-02-10 19:38:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:38:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15595 transitions. [2020-02-10 19:38:42,003 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15595 transitions. Word has length 31 [2020-02-10 19:38:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:42,004 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15595 transitions. [2020-02-10 19:38:42,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15595 transitions. [2020-02-10 19:38:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:42,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:42,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:42,009 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:42,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1920533422, now seen corresponding path program 422 times [2020-02-10 19:38:42,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:42,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659172037] [2020-02-10 19:38:42,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:42,540 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:42,674 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:42,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659172037] [2020-02-10 19:38:42,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:42,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:42,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083064711] [2020-02-10 19:38:42,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:42,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:42,684 INFO L87 Difference]: Start difference. First operand 3131 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:38:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:42,920 INFO L93 Difference]: Finished difference Result 6029 states and 26837 transitions. [2020-02-10 19:38:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:42,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:42,936 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 19:38:42,936 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:38:42,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:38:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-02-10 19:38:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:38:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15578 transitions. [2020-02-10 19:38:43,145 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15578 transitions. Word has length 31 [2020-02-10 19:38:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:43,146 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15578 transitions. [2020-02-10 19:38:43,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15578 transitions. [2020-02-10 19:38:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:43,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:43,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:43,151 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:43,151 INFO L82 PathProgramCache]: Analyzing trace with hash -868882882, now seen corresponding path program 423 times [2020-02-10 19:38:43,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:43,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956307427] [2020-02-10 19:38:43,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:43,694 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:38:43,827 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:43,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956307427] [2020-02-10 19:38:43,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:43,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:43,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78418949] [2020-02-10 19:38:43,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:43,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:43,838 INFO L87 Difference]: Start difference. First operand 3125 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:38:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:44,089 INFO L93 Difference]: Finished difference Result 6039 states and 26858 transitions. [2020-02-10 19:38:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:44,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:44,104 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 19:38:44,104 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 19:38:44,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 19:38:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3134. [2020-02-10 19:38:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:38:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-02-10 19:38:44,316 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-02-10 19:38:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:44,316 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-02-10 19:38:44,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-02-10 19:38:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:44,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:44,321 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash -798772846, now seen corresponding path program 424 times [2020-02-10 19:38:44,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:44,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404674349] [2020-02-10 19:38:44,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:44,861 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:38:44,990 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:44,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404674349] [2020-02-10 19:38:44,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:44,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:44,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49920581] [2020-02-10 19:38:44,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:44,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:44,999 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:38:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:45,204 INFO L93 Difference]: Finished difference Result 6042 states and 26855 transitions. [2020-02-10 19:38:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:45,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:45,220 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 19:38:45,220 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 19:38:45,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 19:38:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-02-10 19:38:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:38:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 19:38:45,429 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 19:38:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:45,429 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 19:38:45,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 19:38:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:45,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:45,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:45,434 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash 252877694, now seen corresponding path program 425 times [2020-02-10 19:38:45,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:45,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429648485] [2020-02-10 19:38:45,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:45,981 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:46,111 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:46,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429648485] [2020-02-10 19:38:46,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:46,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:46,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569851521] [2020-02-10 19:38:46,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:46,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:46,121 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:38:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:46,379 INFO L93 Difference]: Finished difference Result 6033 states and 26837 transitions. [2020-02-10 19:38:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:46,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:46,394 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 19:38:46,394 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:38:46,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:38:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3132. [2020-02-10 19:38:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:38:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15584 transitions. [2020-02-10 19:38:46,610 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15584 transitions. Word has length 31 [2020-02-10 19:38:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:46,610 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15584 transitions. [2020-02-10 19:38:46,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15584 transitions. [2020-02-10 19:38:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:46,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:46,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:46,616 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1859550936, now seen corresponding path program 426 times [2020-02-10 19:38:46,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:46,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582869596] [2020-02-10 19:38:46,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:47,068 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2020-02-10 19:38:47,195 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:38:47,329 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:47,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582869596] [2020-02-10 19:38:47,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:47,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:47,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390551735] [2020-02-10 19:38:47,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:47,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:47,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:47,339 INFO L87 Difference]: Start difference. First operand 3132 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:38:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:47,538 INFO L93 Difference]: Finished difference Result 6038 states and 26840 transitions. [2020-02-10 19:38:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:47,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:47,554 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 19:38:47,554 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 19:38:47,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 19:38:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3118. [2020-02-10 19:38:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 19:38:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15552 transitions. [2020-02-10 19:38:47,763 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15552 transitions. Word has length 31 [2020-02-10 19:38:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:47,763 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15552 transitions. [2020-02-10 19:38:47,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15552 transitions. [2020-02-10 19:38:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:47,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:47,768 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1570364298, now seen corresponding path program 427 times [2020-02-10 19:38:47,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:47,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829864113] [2020-02-10 19:38:47,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:48,306 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:48,437 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:48,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 19:38:48,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829864113] [2020-02-10 19:38:48,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:48,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:48,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959181123] [2020-02-10 19:38:48,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:48,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:48,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:48,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:48,447 INFO L87 Difference]: Start difference. First operand 3118 states and 15552 transitions. Second operand 12 states. [2020-02-10 19:38:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:48,684 INFO L93 Difference]: Finished difference Result 6016 states and 26804 transitions. [2020-02-10 19:38:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:48,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:48,698 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 19:38:48,698 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 19:38:48,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 19:38:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3129. [2020-02-10 19:38:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:38:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15583 transitions. [2020-02-10 19:38:48,907 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15583 transitions. Word has length 31 [2020-02-10 19:38:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:48,907 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15583 transitions. [2020-02-10 19:38:48,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15583 transitions. [2020-02-10 19:38:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:48,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:48,912 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash -119578606, now seen corresponding path program 428 times [2020-02-10 19:38:48,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:48,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298029113] [2020-02-10 19:38:48,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:49,448 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:49,577 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:49,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 19:38:49,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298029113] [2020-02-10 19:38:49,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:49,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:49,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145712595] [2020-02-10 19:38:49,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:49,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:49,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:49,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:49,587 INFO L87 Difference]: Start difference. First operand 3129 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:38:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:49,832 INFO L93 Difference]: Finished difference Result 6017 states and 26801 transitions. [2020-02-10 19:38:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:49,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:49,847 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 19:38:49,847 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 19:38:49,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 19:38:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3124. [2020-02-10 19:38:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:38:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 19:38:50,065 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 19:38:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:50,065 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 19:38:50,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 19:38:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:50,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:50,071 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 509586208, now seen corresponding path program 429 times [2020-02-10 19:38:50,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:50,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226322230] [2020-02-10 19:38:50,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:50,604 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:38:50,730 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:50,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226322230] [2020-02-10 19:38:50,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:50,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:50,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823019738] [2020-02-10 19:38:50,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:50,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:50,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:50,740 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:38:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:51,012 INFO L93 Difference]: Finished difference Result 6022 states and 26810 transitions. [2020-02-10 19:38:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:51,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:51,028 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 19:38:51,028 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:38:51,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:38:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 19:38:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:38:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15580 transitions. [2020-02-10 19:38:51,237 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15580 transitions. Word has length 31 [2020-02-10 19:38:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:51,237 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15580 transitions. [2020-02-10 19:38:51,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15580 transitions. [2020-02-10 19:38:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:51,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:51,242 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1002181970, now seen corresponding path program 430 times [2020-02-10 19:38:51,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:51,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153553065] [2020-02-10 19:38:51,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:51,794 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:38:51,925 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:38:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:51,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153553065] [2020-02-10 19:38:51,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:51,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:51,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090266989] [2020-02-10 19:38:51,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:51,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:51,936 INFO L87 Difference]: Start difference. First operand 3130 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:38:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:52,138 INFO L93 Difference]: Finished difference Result 6028 states and 26816 transitions. [2020-02-10 19:38:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:52,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:52,153 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 19:38:52,153 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 19:38:52,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 19:38:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-02-10 19:38:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:38:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15563 transitions. [2020-02-10 19:38:52,370 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15563 transitions. Word has length 31 [2020-02-10 19:38:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:52,371 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15563 transitions. [2020-02-10 19:38:52,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15563 transitions. [2020-02-10 19:38:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:52,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:52,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:52,376 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2028979168, now seen corresponding path program 431 times [2020-02-10 19:38:52,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:52,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766221254] [2020-02-10 19:38:52,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:52,916 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:53,048 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:53,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 19:38:53,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766221254] [2020-02-10 19:38:53,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:53,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:53,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563628921] [2020-02-10 19:38:53,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:53,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:53,059 INFO L87 Difference]: Start difference. First operand 3124 states and 15563 transitions. Second operand 12 states. [2020-02-10 19:38:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:53,323 INFO L93 Difference]: Finished difference Result 6025 states and 26811 transitions. [2020-02-10 19:38:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:53,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:53,339 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 19:38:53,339 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 19:38:53,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 19:38:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-02-10 19:38:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:38:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15576 transitions. [2020-02-10 19:38:53,557 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15576 transitions. Word has length 31 [2020-02-10 19:38:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:53,558 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15576 transitions. [2020-02-10 19:38:53,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15576 transitions. [2020-02-10 19:38:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:53,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:53,563 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash 153559498, now seen corresponding path program 432 times [2020-02-10 19:38:53,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:53,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682025331] [2020-02-10 19:38:53,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:54,105 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:38:54,237 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:38:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:54,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682025331] [2020-02-10 19:38:54,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:54,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:54,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940645491] [2020-02-10 19:38:54,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:54,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:54,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:54,248 INFO L87 Difference]: Start difference. First operand 3131 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:38:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:54,448 INFO L93 Difference]: Finished difference Result 6030 states and 26814 transitions. [2020-02-10 19:38:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:54,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:54,463 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 19:38:54,463 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 19:38:54,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 19:38:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3112. [2020-02-10 19:38:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 19:38:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15535 transitions. [2020-02-10 19:38:54,678 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15535 transitions. Word has length 31 [2020-02-10 19:38:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:54,679 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15535 transitions. [2020-02-10 19:38:54,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15535 transitions. [2020-02-10 19:38:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:54,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:54,684 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash -331869382, now seen corresponding path program 433 times [2020-02-10 19:38:54,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:54,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456698248] [2020-02-10 19:38:54,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:55,046 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2020-02-10 19:38:55,275 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:38:55,405 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:38:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:55,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456698248] [2020-02-10 19:38:55,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:55,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:55,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996249763] [2020-02-10 19:38:55,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:55,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:55,416 INFO L87 Difference]: Start difference. First operand 3112 states and 15535 transitions. Second operand 12 states. [2020-02-10 19:38:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:55,715 INFO L93 Difference]: Finished difference Result 6055 states and 26922 transitions. [2020-02-10 19:38:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:55,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:55,731 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 19:38:55,731 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:38:55,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:38:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-02-10 19:38:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:38:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-02-10 19:38:55,944 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-02-10 19:38:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:55,944 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-02-10 19:38:55,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-02-10 19:38:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:55,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:55,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:55,952 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1599326560, now seen corresponding path program 434 times [2020-02-10 19:38:55,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:55,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31385207] [2020-02-10 19:38:55,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:56,492 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:38:56,620 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:38:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:56,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31385207] [2020-02-10 19:38:56,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:56,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:56,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892408439] [2020-02-10 19:38:56,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:56,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:56,631 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-02-10 19:38:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:56,877 INFO L93 Difference]: Finished difference Result 6056 states and 26916 transitions. [2020-02-10 19:38:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:56,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:56,893 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:38:56,893 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 19:38:56,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 19:38:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 19:38:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:38:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15590 transitions. [2020-02-10 19:38:57,103 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15590 transitions. Word has length 31 [2020-02-10 19:38:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:57,103 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15590 transitions. [2020-02-10 19:38:57,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15590 transitions. [2020-02-10 19:38:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:57,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:57,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:57,109 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash -756180618, now seen corresponding path program 435 times [2020-02-10 19:38:57,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:57,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199967467] [2020-02-10 19:38:57,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:57,643 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:38:57,775 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:38:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:57,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199967467] [2020-02-10 19:38:57,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:57,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:57,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18444314] [2020-02-10 19:38:57,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:57,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:57,785 INFO L87 Difference]: Start difference. First operand 3127 states and 15590 transitions. Second operand 12 states. [2020-02-10 19:38:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:58,024 INFO L93 Difference]: Finished difference Result 6050 states and 26904 transitions. [2020-02-10 19:38:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:58,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:58,038 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 19:38:58,039 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 19:38:58,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 19:38:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3133. [2020-02-10 19:38:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:38:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15601 transitions. [2020-02-10 19:38:58,253 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15601 transitions. Word has length 31 [2020-02-10 19:38:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:58,253 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15601 transitions. [2020-02-10 19:38:58,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15601 transitions. [2020-02-10 19:38:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:58,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:58,258 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1426358048, now seen corresponding path program 436 times [2020-02-10 19:38:58,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:58,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622779730] [2020-02-10 19:38:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:58,796 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:38:58,929 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:38:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:38:58,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622779730] [2020-02-10 19:38:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:38:58,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:38:58,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824927994] [2020-02-10 19:38:58,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:38:58,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:38:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:38:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:38:58,940 INFO L87 Difference]: Start difference. First operand 3133 states and 15601 transitions. Second operand 12 states. [2020-02-10 19:38:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:38:59,215 INFO L93 Difference]: Finished difference Result 6048 states and 26894 transitions. [2020-02-10 19:38:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:38:59,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:38:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:38:59,231 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 19:38:59,231 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 19:38:59,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:38:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 19:38:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-02-10 19:38:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:38:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15584 transitions. [2020-02-10 19:38:59,439 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15584 transitions. Word has length 31 [2020-02-10 19:38:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:38:59,439 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15584 transitions. [2020-02-10 19:38:59,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:38:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15584 transitions. [2020-02-10 19:38:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:38:59,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:38:59,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:38:59,444 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:38:59,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:38:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1634862646, now seen corresponding path program 437 times [2020-02-10 19:38:59,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:38:59,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393054440] [2020-02-10 19:38:59,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:38:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:38:59,984 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:00,114 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:00,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393054440] [2020-02-10 19:39:00,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:00,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:00,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117394202] [2020-02-10 19:39:00,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:00,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:00,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:00,125 INFO L87 Difference]: Start difference. First operand 3127 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:39:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:00,480 INFO L93 Difference]: Finished difference Result 6052 states and 26902 transitions. [2020-02-10 19:39:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:00,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:00,495 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 19:39:00,496 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 19:39:00,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 19:39:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3133. [2020-02-10 19:39:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:39:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15595 transitions. [2020-02-10 19:39:00,703 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15595 transitions. Word has length 31 [2020-02-10 19:39:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:00,703 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15595 transitions. [2020-02-10 19:39:00,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15595 transitions. [2020-02-10 19:39:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:00,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:00,708 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 789891194, now seen corresponding path program 438 times [2020-02-10 19:39:00,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:00,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63937777] [2020-02-10 19:39:00,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:01,261 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:01,393 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:01,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63937777] [2020-02-10 19:39:01,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:01,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:01,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759627378] [2020-02-10 19:39:01,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:01,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:01,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:01,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:01,404 INFO L87 Difference]: Start difference. First operand 3133 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:39:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:01,729 INFO L93 Difference]: Finished difference Result 6049 states and 26890 transitions. [2020-02-10 19:39:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:01,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:01,744 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 19:39:01,744 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 19:39:01,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 19:39:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3121. [2020-02-10 19:39:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:39:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15567 transitions. [2020-02-10 19:39:01,959 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15567 transitions. Word has length 31 [2020-02-10 19:39:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:01,959 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15567 transitions. [2020-02-10 19:39:01,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15567 transitions. [2020-02-10 19:39:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:01,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:01,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:01,965 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1143748196, now seen corresponding path program 439 times [2020-02-10 19:39:01,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:01,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478192050] [2020-02-10 19:39:01,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:02,518 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:39:02,647 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:39:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:02,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478192050] [2020-02-10 19:39:02,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:02,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:02,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868506906] [2020-02-10 19:39:02,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:02,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:02,656 INFO L87 Difference]: Start difference. First operand 3121 states and 15567 transitions. Second operand 12 states. [2020-02-10 19:39:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:03,021 INFO L93 Difference]: Finished difference Result 6073 states and 26959 transitions. [2020-02-10 19:39:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:03,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:03,040 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 19:39:03,040 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 19:39:03,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 19:39:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3140. [2020-02-10 19:39:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:39:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15619 transitions. [2020-02-10 19:39:03,302 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15619 transitions. Word has length 31 [2020-02-10 19:39:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:03,302 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15619 transitions. [2020-02-10 19:39:03,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15619 transitions. [2020-02-10 19:39:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:03,307 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:03,307 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:03,308 INFO L82 PathProgramCache]: Analyzing trace with hash -123708982, now seen corresponding path program 440 times [2020-02-10 19:39:03,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:03,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637335374] [2020-02-10 19:39:03,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:03,861 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:04,003 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:04,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637335374] [2020-02-10 19:39:04,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:04,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:04,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867273786] [2020-02-10 19:39:04,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:04,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:04,014 INFO L87 Difference]: Start difference. First operand 3140 states and 15619 transitions. Second operand 12 states. [2020-02-10 19:39:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:04,369 INFO L93 Difference]: Finished difference Result 6074 states and 26953 transitions. [2020-02-10 19:39:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:04,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:04,385 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 19:39:04,385 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 19:39:04,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 19:39:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3132. [2020-02-10 19:39:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:39:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-02-10 19:39:04,593 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-02-10 19:39:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:04,593 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-02-10 19:39:04,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-02-10 19:39:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:04,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:04,598 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash -341341130, now seen corresponding path program 441 times [2020-02-10 19:39:04,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:04,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282330253] [2020-02-10 19:39:04,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:05,151 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:05,285 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:05,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282330253] [2020-02-10 19:39:05,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:05,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:05,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689707034] [2020-02-10 19:39:05,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:05,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:05,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:05,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:05,294 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-02-10 19:39:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:05,623 INFO L93 Difference]: Finished difference Result 6076 states and 26956 transitions. [2020-02-10 19:39:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:05,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:05,638 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 19:39:05,638 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 19:39:05,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 19:39:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3141. [2020-02-10 19:39:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:39:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15613 transitions. [2020-02-10 19:39:05,852 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15613 transitions. Word has length 31 [2020-02-10 19:39:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:05,852 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15613 transitions. [2020-02-10 19:39:05,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15613 transitions. [2020-02-10 19:39:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:05,857 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:05,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:05,857 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash -271231094, now seen corresponding path program 442 times [2020-02-10 19:39:05,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:05,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986269535] [2020-02-10 19:39:05,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:06,420 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:39:06,549 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:06,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986269535] [2020-02-10 19:39:06,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:06,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:06,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475726888] [2020-02-10 19:39:06,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:06,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:06,559 INFO L87 Difference]: Start difference. First operand 3141 states and 15613 transitions. Second operand 12 states. [2020-02-10 19:39:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:06,890 INFO L93 Difference]: Finished difference Result 6079 states and 26953 transitions. [2020-02-10 19:39:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:06,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:06,906 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:39:06,906 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 19:39:06,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 19:39:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-02-10 19:39:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:39:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15587 transitions. [2020-02-10 19:39:07,113 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15587 transitions. Word has length 31 [2020-02-10 19:39:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:07,113 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15587 transitions. [2020-02-10 19:39:07,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15587 transitions. [2020-02-10 19:39:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:07,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:07,119 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2049702134, now seen corresponding path program 443 times [2020-02-10 19:39:07,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:07,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917948630] [2020-02-10 19:39:07,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:07,686 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:07,815 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:07,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917948630] [2020-02-10 19:39:07,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:07,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:07,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347474323] [2020-02-10 19:39:07,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:07,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:07,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:07,824 INFO L87 Difference]: Start difference. First operand 3132 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:39:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:08,091 INFO L93 Difference]: Finished difference Result 6080 states and 26955 transitions. [2020-02-10 19:39:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:08,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:08,106 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 19:39:08,107 INFO L226 Difference]: Without dead ends: 6060 [2020-02-10 19:39:08,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-02-10 19:39:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3143. [2020-02-10 19:39:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:39:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15607 transitions. [2020-02-10 19:39:08,315 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15607 transitions. Word has length 31 [2020-02-10 19:39:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:08,315 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15607 transitions. [2020-02-10 19:39:08,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15607 transitions. [2020-02-10 19:39:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:08,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:08,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:08,320 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -907697948, now seen corresponding path program 444 times [2020-02-10 19:39:08,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:08,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966789755] [2020-02-10 19:39:08,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:08,894 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:09,028 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:09,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 19:39:09,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966789755] [2020-02-10 19:39:09,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:09,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:09,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112511881] [2020-02-10 19:39:09,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:09,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:09,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:09,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:09,038 INFO L87 Difference]: Start difference. First operand 3143 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:39:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:09,224 INFO L93 Difference]: Finished difference Result 6082 states and 26949 transitions. [2020-02-10 19:39:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:09,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:09,239 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:39:09,239 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:39:09,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:39:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3121. [2020-02-10 19:39:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:39:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-02-10 19:39:09,446 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-02-10 19:39:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:09,446 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-02-10 19:39:09,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-02-10 19:39:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:09,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:09,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:09,452 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash 450690532, now seen corresponding path program 445 times [2020-02-10 19:39:09,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:09,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457075218] [2020-02-10 19:39:09,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:09,995 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:10,126 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:10,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457075218] [2020-02-10 19:39:10,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:10,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:10,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038639698] [2020-02-10 19:39:10,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:10,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:10,136 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-02-10 19:39:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:10,352 INFO L93 Difference]: Finished difference Result 6055 states and 26905 transitions. [2020-02-10 19:39:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:10,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:10,367 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 19:39:10,367 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:39:10,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:39:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-02-10 19:39:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:39:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-02-10 19:39:10,581 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-02-10 19:39:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:10,581 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-02-10 19:39:10,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-02-10 19:39:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:10,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:10,586 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1661738098, now seen corresponding path program 446 times [2020-02-10 19:39:10,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:10,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610115402] [2020-02-10 19:39:10,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:11,125 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:11,259 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:11,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610115402] [2020-02-10 19:39:11,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:11,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:11,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751183273] [2020-02-10 19:39:11,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:11,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:11,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:11,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:11,269 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:39:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:11,496 INFO L93 Difference]: Finished difference Result 6053 states and 26895 transitions. [2020-02-10 19:39:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:11,496 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:11,512 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:39:11,512 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:39:11,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:39:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3128. [2020-02-10 19:39:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:39:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15578 transitions. [2020-02-10 19:39:11,759 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15578 transitions. Word has length 31 [2020-02-10 19:39:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:11,759 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15578 transitions. [2020-02-10 19:39:11,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15578 transitions. [2020-02-10 19:39:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:11,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:11,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:11,764 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:11,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:11,765 INFO L82 PathProgramCache]: Analyzing trace with hash -610087558, now seen corresponding path program 447 times [2020-02-10 19:39:11,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:11,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373311287] [2020-02-10 19:39:11,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:12,317 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:12,446 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:12,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 19:39:12,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373311287] [2020-02-10 19:39:12,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:12,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:12,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507772755] [2020-02-10 19:39:12,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:12,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:12,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:12,456 INFO L87 Difference]: Start difference. First operand 3128 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:39:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:12,709 INFO L93 Difference]: Finished difference Result 6063 states and 26916 transitions. [2020-02-10 19:39:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:12,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:12,723 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 19:39:12,723 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 19:39:12,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 19:39:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3137. [2020-02-10 19:39:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:39:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15595 transitions. [2020-02-10 19:39:12,933 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15595 transitions. Word has length 31 [2020-02-10 19:39:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:12,933 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15595 transitions. [2020-02-10 19:39:12,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15595 transitions. [2020-02-10 19:39:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:12,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:12,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:12,938 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -539977522, now seen corresponding path program 448 times [2020-02-10 19:39:12,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:12,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924500640] [2020-02-10 19:39:12,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:13,495 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:39:13,626 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:13,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 19:39:13,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924500640] [2020-02-10 19:39:13,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:13,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:13,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974542274] [2020-02-10 19:39:13,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:13,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:13,636 INFO L87 Difference]: Start difference. First operand 3137 states and 15595 transitions. Second operand 12 states. [2020-02-10 19:39:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:13,903 INFO L93 Difference]: Finished difference Result 6066 states and 26913 transitions. [2020-02-10 19:39:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:13,904 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:13,917 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 19:39:13,918 INFO L226 Difference]: Without dead ends: 6035 [2020-02-10 19:39:13,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-02-10 19:39:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3128. [2020-02-10 19:39:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:39:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15571 transitions. [2020-02-10 19:39:14,132 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15571 transitions. Word has length 31 [2020-02-10 19:39:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:14,132 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15571 transitions. [2020-02-10 19:39:14,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15571 transitions. [2020-02-10 19:39:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:14,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:14,138 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 511673018, now seen corresponding path program 449 times [2020-02-10 19:39:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:14,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754057400] [2020-02-10 19:39:14,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:14,671 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:14,803 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:14,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754057400] [2020-02-10 19:39:14,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:14,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:14,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621682971] [2020-02-10 19:39:14,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:14,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:14,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:14,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:14,813 INFO L87 Difference]: Start difference. First operand 3128 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:39:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:15,114 INFO L93 Difference]: Finished difference Result 6057 states and 26895 transitions. [2020-02-10 19:39:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:15,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:15,130 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 19:39:15,130 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 19:39:15,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 19:39:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3135. [2020-02-10 19:39:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:39:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15584 transitions. [2020-02-10 19:39:15,345 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15584 transitions. Word has length 31 [2020-02-10 19:39:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:15,346 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15584 transitions. [2020-02-10 19:39:15,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15584 transitions. [2020-02-10 19:39:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:15,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:15,351 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1600755612, now seen corresponding path program 450 times [2020-02-10 19:39:15,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:15,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902134055] [2020-02-10 19:39:15,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:15,899 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:39:16,028 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:16,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 19:39:16,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902134055] [2020-02-10 19:39:16,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:16,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:16,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413750443] [2020-02-10 19:39:16,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:16,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:16,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:16,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:16,038 INFO L87 Difference]: Start difference. First operand 3135 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:39:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:16,233 INFO L93 Difference]: Finished difference Result 6062 states and 26898 transitions. [2020-02-10 19:39:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:16,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:16,247 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:39:16,247 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:39:16,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:39:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-02-10 19:39:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:39:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15551 transitions. [2020-02-10 19:39:16,460 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15551 transitions. Word has length 31 [2020-02-10 19:39:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:16,460 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15551 transitions. [2020-02-10 19:39:16,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15551 transitions. [2020-02-10 19:39:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:16,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:16,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:16,466 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:16,466 INFO L82 PathProgramCache]: Analyzing trace with hash 291130506, now seen corresponding path program 451 times [2020-02-10 19:39:16,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:16,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671221707] [2020-02-10 19:39:16,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:17,033 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:17,167 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:17,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671221707] [2020-02-10 19:39:17,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:17,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:17,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837257747] [2020-02-10 19:39:17,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:17,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:17,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:17,177 INFO L87 Difference]: Start difference. First operand 3121 states and 15551 transitions. Second operand 12 states. [2020-02-10 19:39:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:17,434 INFO L93 Difference]: Finished difference Result 6061 states and 26910 transitions. [2020-02-10 19:39:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:17,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:17,448 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:39:17,449 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 19:39:17,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 19:39:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3135. [2020-02-10 19:39:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:39:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15590 transitions. [2020-02-10 19:39:17,662 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15590 transitions. Word has length 31 [2020-02-10 19:39:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:17,662 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15590 transitions. [2020-02-10 19:39:17,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15590 transitions. [2020-02-10 19:39:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:17,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:17,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:17,668 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash -553840946, now seen corresponding path program 452 times [2020-02-10 19:39:17,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:17,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183021074] [2020-02-10 19:39:17,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:18,217 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:18,350 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:18,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183021074] [2020-02-10 19:39:18,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:18,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:18,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783062104] [2020-02-10 19:39:18,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:18,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:18,360 INFO L87 Difference]: Start difference. First operand 3135 states and 15590 transitions. Second operand 12 states. [2020-02-10 19:39:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:18,588 INFO L93 Difference]: Finished difference Result 6058 states and 26898 transitions. [2020-02-10 19:39:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:18,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:18,603 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 19:39:18,603 INFO L226 Difference]: Without dead ends: 6035 [2020-02-10 19:39:18,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-02-10 19:39:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3129. [2020-02-10 19:39:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:39:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15573 transitions. [2020-02-10 19:39:18,826 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15573 transitions. Word has length 31 [2020-02-10 19:39:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:18,827 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15573 transitions. [2020-02-10 19:39:18,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15573 transitions. [2020-02-10 19:39:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:18,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:18,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:18,832 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -769647584, now seen corresponding path program 453 times [2020-02-10 19:39:18,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:18,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222659763] [2020-02-10 19:39:18,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:19,395 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:19,526 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:19,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222659763] [2020-02-10 19:39:19,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:19,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:19,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387586349] [2020-02-10 19:39:19,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:19,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:19,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:19,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:19,537 INFO L87 Difference]: Start difference. First operand 3129 states and 15573 transitions. Second operand 12 states. [2020-02-10 19:39:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:19,813 INFO L93 Difference]: Finished difference Result 6071 states and 26925 transitions. [2020-02-10 19:39:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:19,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:19,830 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 19:39:19,830 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 19:39:19,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:19,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 19:39:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-02-10 19:39:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:39:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15593 transitions. [2020-02-10 19:39:20,036 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15593 transitions. Word has length 31 [2020-02-10 19:39:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:20,037 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15593 transitions. [2020-02-10 19:39:20,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15593 transitions. [2020-02-10 19:39:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:20,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:20,042 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash 567919630, now seen corresponding path program 454 times [2020-02-10 19:39:20,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:20,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726258400] [2020-02-10 19:39:20,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:20,595 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:20,728 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:20,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726258400] [2020-02-10 19:39:20,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:20,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:20,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061724946] [2020-02-10 19:39:20,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:20,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:20,739 INFO L87 Difference]: Start difference. First operand 3140 states and 15593 transitions. Second operand 12 states. [2020-02-10 19:39:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:20,963 INFO L93 Difference]: Finished difference Result 6073 states and 26919 transitions. [2020-02-10 19:39:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:20,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:20,977 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 19:39:20,978 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 19:39:20,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 19:39:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-02-10 19:39:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:39:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15565 transitions. [2020-02-10 19:39:21,186 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15565 transitions. Word has length 31 [2020-02-10 19:39:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:21,186 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15565 transitions. [2020-02-10 19:39:21,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15565 transitions. [2020-02-10 19:39:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:21,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:21,191 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2038930272, now seen corresponding path program 455 times [2020-02-10 19:39:21,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:21,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899481900] [2020-02-10 19:39:21,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:21,748 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:39:21,878 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:21,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899481900] [2020-02-10 19:39:21,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:21,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:21,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158071294] [2020-02-10 19:39:21,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:21,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:21,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:21,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:21,887 INFO L87 Difference]: Start difference. First operand 3129 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:39:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:22,109 INFO L93 Difference]: Finished difference Result 6061 states and 26895 transitions. [2020-02-10 19:39:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:22,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:22,125 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:39:22,125 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 19:39:22,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 19:39:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3136. [2020-02-10 19:39:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:39:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15578 transitions. [2020-02-10 19:39:22,336 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15578 transitions. Word has length 31 [2020-02-10 19:39:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:22,336 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15578 transitions. [2020-02-10 19:39:22,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15578 transitions. [2020-02-10 19:39:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:22,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:22,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:22,341 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 143608394, now seen corresponding path program 456 times [2020-02-10 19:39:22,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:22,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6001992] [2020-02-10 19:39:22,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:22,886 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:23,015 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:23,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 19:39:23,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6001992] [2020-02-10 19:39:23,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:23,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:23,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661180216] [2020-02-10 19:39:23,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:23,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:23,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:23,025 INFO L87 Difference]: Start difference. First operand 3136 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:39:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:23,223 INFO L93 Difference]: Finished difference Result 6066 states and 26898 transitions. [2020-02-10 19:39:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:23,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:23,238 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 19:39:23,238 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 19:39:23,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 19:39:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3112. [2020-02-10 19:39:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 19:39:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15527 transitions. [2020-02-10 19:39:23,451 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15527 transitions. Word has length 31 [2020-02-10 19:39:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:23,452 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15527 transitions. [2020-02-10 19:39:23,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15527 transitions. [2020-02-10 19:39:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:23,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:23,457 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash -971486278, now seen corresponding path program 457 times [2020-02-10 19:39:23,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:23,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707639799] [2020-02-10 19:39:23,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:23,992 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:24,125 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:24,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707639799] [2020-02-10 19:39:24,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:24,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:24,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837419413] [2020-02-10 19:39:24,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:24,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:24,136 INFO L87 Difference]: Start difference. First operand 3112 states and 15527 transitions. Second operand 12 states. [2020-02-10 19:39:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:24,366 INFO L93 Difference]: Finished difference Result 6020 states and 26816 transitions. [2020-02-10 19:39:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:24,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:24,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:24,381 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 19:39:24,381 INFO L226 Difference]: Without dead ends: 6004 [2020-02-10 19:39:24,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-02-10 19:39:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3129. [2020-02-10 19:39:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:39:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15586 transitions. [2020-02-10 19:39:24,596 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15586 transitions. Word has length 31 [2020-02-10 19:39:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:24,596 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15586 transitions. [2020-02-10 19:39:24,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15586 transitions. [2020-02-10 19:39:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:24,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:24,602 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1816457730, now seen corresponding path program 458 times [2020-02-10 19:39:24,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:24,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737797310] [2020-02-10 19:39:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:25,139 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:39:25,266 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:25,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 19:39:25,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737797310] [2020-02-10 19:39:25,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:25,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:25,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915996636] [2020-02-10 19:39:25,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:25,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:25,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:25,277 INFO L87 Difference]: Start difference. First operand 3129 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:39:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:25,512 INFO L93 Difference]: Finished difference Result 6024 states and 26819 transitions. [2020-02-10 19:39:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:25,512 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:25,527 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 19:39:25,527 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 19:39:25,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 19:39:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3124. [2020-02-10 19:39:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:39:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15572 transitions. [2020-02-10 19:39:25,738 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15572 transitions. Word has length 31 [2020-02-10 19:39:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:25,738 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15572 transitions. [2020-02-10 19:39:25,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15572 transitions. [2020-02-10 19:39:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:25,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:25,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:25,743 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:25,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1395797514, now seen corresponding path program 459 times [2020-02-10 19:39:25,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:25,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938366623] [2020-02-10 19:39:25,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:26,290 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:26,417 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:26,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938366623] [2020-02-10 19:39:26,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:26,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:26,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282662286] [2020-02-10 19:39:26,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:26,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:26,427 INFO L87 Difference]: Start difference. First operand 3124 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:39:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:26,661 INFO L93 Difference]: Finished difference Result 6017 states and 26805 transitions. [2020-02-10 19:39:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:26,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:26,677 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 19:39:26,677 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:39:26,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:39:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3129. [2020-02-10 19:39:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:39:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-02-10 19:39:26,889 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-02-10 19:39:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:26,889 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-02-10 19:39:26,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-02-10 19:39:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:26,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:26,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:26,895 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:26,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1209226878, now seen corresponding path program 460 times [2020-02-10 19:39:26,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:26,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569391160] [2020-02-10 19:39:26,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:27,450 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:27,581 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:27,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 19:39:27,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569391160] [2020-02-10 19:39:27,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:27,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:27,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769369406] [2020-02-10 19:39:27,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:27,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:27,592 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-02-10 19:39:27,852 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-02-10 19:39:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:27,876 INFO L93 Difference]: Finished difference Result 6018 states and 26802 transitions. [2020-02-10 19:39:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:27,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:27,892 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 19:39:27,892 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 19:39:27,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 19:39:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3124. [2020-02-10 19:39:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:39:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15567 transitions. [2020-02-10 19:39:28,098 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15567 transitions. Word has length 31 [2020-02-10 19:39:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:28,098 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15567 transitions. [2020-02-10 19:39:28,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15567 transitions. [2020-02-10 19:39:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:28,103 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:28,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:28,103 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1629887094, now seen corresponding path program 461 times [2020-02-10 19:39:28,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:28,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745134548] [2020-02-10 19:39:28,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:28,771 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:28,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745134548] [2020-02-10 19:39:28,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:28,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:28,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233770034] [2020-02-10 19:39:28,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:28,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:28,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:28,781 INFO L87 Difference]: Start difference. First operand 3124 states and 15567 transitions. Second operand 12 states. [2020-02-10 19:39:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:29,129 INFO L93 Difference]: Finished difference Result 6026 states and 26819 transitions. [2020-02-10 19:39:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:29,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:29,143 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 19:39:29,144 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:39:29,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:39:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 19:39:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:39:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15578 transitions. [2020-02-10 19:39:29,352 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15578 transitions. Word has length 31 [2020-02-10 19:39:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:29,352 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15578 transitions. [2020-02-10 19:39:29,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15578 transitions. [2020-02-10 19:39:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:29,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:29,357 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash 784915642, now seen corresponding path program 462 times [2020-02-10 19:39:29,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:29,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291118528] [2020-02-10 19:39:29,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:29,896 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:30,030 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:30,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291118528] [2020-02-10 19:39:30,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:30,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:30,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71791272] [2020-02-10 19:39:30,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:30,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:30,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:30,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:30,041 INFO L87 Difference]: Start difference. First operand 3130 states and 15578 transitions. Second operand 12 states. [2020-02-10 19:39:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:30,288 INFO L93 Difference]: Finished difference Result 6023 states and 26807 transitions. [2020-02-10 19:39:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:30,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:30,303 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 19:39:30,303 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 19:39:30,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 19:39:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3119. [2020-02-10 19:39:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:39:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15553 transitions. [2020-02-10 19:39:30,509 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15553 transitions. Word has length 31 [2020-02-10 19:39:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:30,509 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15553 transitions. [2020-02-10 19:39:30,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15553 transitions. [2020-02-10 19:39:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:30,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:30,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:30,514 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash 504131300, now seen corresponding path program 463 times [2020-02-10 19:39:30,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:30,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647594568] [2020-02-10 19:39:30,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:31,048 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:31,182 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39: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 19:39:31,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647594568] [2020-02-10 19:39:31,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:31,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:31,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801461620] [2020-02-10 19:39:31,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:31,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:31,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:31,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:31,192 INFO L87 Difference]: Start difference. First operand 3119 states and 15553 transitions. Second operand 12 states. [2020-02-10 19:39:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:31,528 INFO L93 Difference]: Finished difference Result 6033 states and 26839 transitions. [2020-02-10 19:39:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:31,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:31,542 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 19:39:31,542 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 19:39:31,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 19:39:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3131. [2020-02-10 19:39:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:39:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15586 transitions. [2020-02-10 19:39:31,751 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15586 transitions. Word has length 31 [2020-02-10 19:39:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:31,751 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15586 transitions. [2020-02-10 19:39:31,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15586 transitions. [2020-02-10 19:39:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:31,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:31,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:31,756 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash -340840152, now seen corresponding path program 464 times [2020-02-10 19:39:31,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:31,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251784223] [2020-02-10 19:39:31,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:32,290 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:39:32,419 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39: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 19:39:32,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251784223] [2020-02-10 19:39:32,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:32,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:32,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590628510] [2020-02-10 19:39:32,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:32,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:32,429 INFO L87 Difference]: Start difference. First operand 3131 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:39:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:32,672 INFO L93 Difference]: Finished difference Result 6037 states and 26842 transitions. [2020-02-10 19:39:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:32,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:32,688 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 19:39:32,688 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:39:32,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:39:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3126. [2020-02-10 19:39:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:39:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 19:39:32,901 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 19:39:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:32,901 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 19:39:32,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 19:39:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:32,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:32,906 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:32,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -980958026, now seen corresponding path program 465 times [2020-02-10 19:39:32,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:32,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379552650] [2020-02-10 19:39:32,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:33,584 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:39:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:33,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379552650] [2020-02-10 19:39:33,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:33,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:33,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850312127] [2020-02-10 19:39:33,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:33,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:33,593 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:39:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:33,842 INFO L93 Difference]: Finished difference Result 6036 states and 26839 transitions. [2020-02-10 19:39:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:33,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:33,856 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:39:33,857 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 19:39:33,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 19:39:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3132. [2020-02-10 19:39:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:39:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15583 transitions. [2020-02-10 19:39:34,065 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15583 transitions. Word has length 31 [2020-02-10 19:39:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:34,065 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15583 transitions. [2020-02-10 19:39:34,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15583 transitions. [2020-02-10 19:39:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:34,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:34,070 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:34,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:34,070 INFO L82 PathProgramCache]: Analyzing trace with hash -488362264, now seen corresponding path program 466 times [2020-02-10 19:39:34,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:34,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66701699] [2020-02-10 19:39:34,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:34,621 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 19:39:34,748 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:39:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:34,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66701699] [2020-02-10 19:39:34,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:34,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:34,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047023343] [2020-02-10 19:39:34,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:34,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:34,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:34,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:34,758 INFO L87 Difference]: Start difference. First operand 3132 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:39:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:34,998 INFO L93 Difference]: Finished difference Result 6042 states and 26845 transitions. [2020-02-10 19:39:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:34,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:35,013 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 19:39:35,013 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 19:39:35,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 19:39:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3126. [2020-02-10 19:39:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:39:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15566 transitions. [2020-02-10 19:39:35,228 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15566 transitions. Word has length 31 [2020-02-10 19:39:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:35,228 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15566 transitions. [2020-02-10 19:39:35,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15566 transitions. [2020-02-10 19:39:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:35,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:35,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:35,233 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2044726582, now seen corresponding path program 467 times [2020-02-10 19:39:35,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:35,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411655881] [2020-02-10 19:39:35,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:35,801 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:39:35,983 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:35,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 19:39:35,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411655881] [2020-02-10 19:39:35,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:35,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:35,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053287873] [2020-02-10 19:39:35,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:35,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:35,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:35,993 INFO L87 Difference]: Start difference. First operand 3126 states and 15566 transitions. Second operand 12 states. [2020-02-10 19:39:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:36,270 INFO L93 Difference]: Finished difference Result 6049 states and 26862 transitions. [2020-02-10 19:39:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:36,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:36,286 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 19:39:36,286 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 19:39:36,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 19:39:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3137. [2020-02-10 19:39:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:39:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-02-10 19:39:36,492 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-02-10 19:39:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:36,493 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-02-10 19:39:36,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-02-10 19:39:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:36,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:36,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:36,498 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -912673500, now seen corresponding path program 468 times [2020-02-10 19:39:36,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:36,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664663692] [2020-02-10 19:39:36,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:37,065 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 19:39:37,196 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:39:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:37,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664663692] [2020-02-10 19:39:37,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:37,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:37,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036403716] [2020-02-10 19:39:37,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:37,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:37,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:37,206 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:39:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:37,431 INFO L93 Difference]: Finished difference Result 6051 states and 26856 transitions. [2020-02-10 19:39:37,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:37,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:37,446 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:39:37,446 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 19:39:37,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 19:39:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3119. [2020-02-10 19:39:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:39:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15546 transitions. [2020-02-10 19:39:37,653 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15546 transitions. Word has length 31 [2020-02-10 19:39:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:37,653 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15546 transitions. [2020-02-10 19:39:37,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15546 transitions. [2020-02-10 19:39:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:37,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:37,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:37,658 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash -188926364, now seen corresponding path program 469 times [2020-02-10 19:39:37,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:37,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939316096] [2020-02-10 19:39:37,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:38,339 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:39:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:38,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939316096] [2020-02-10 19:39:38,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:38,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:38,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614932437] [2020-02-10 19:39:38,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:38,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:38,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:38,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:38,349 INFO L87 Difference]: Start difference. First operand 3119 states and 15546 transitions. Second operand 12 states. [2020-02-10 19:39:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:38,647 INFO L93 Difference]: Finished difference Result 6022 states and 26808 transitions. [2020-02-10 19:39:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:38,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:38,662 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 19:39:38,662 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:39:38,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:39:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 19:39:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:39:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-02-10 19:39:38,877 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-02-10 19:39:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:38,877 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-02-10 19:39:38,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-02-10 19:39:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:38,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:38,882 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1878869268, now seen corresponding path program 470 times [2020-02-10 19:39:38,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:38,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342784529] [2020-02-10 19:39:38,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:39,440 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:39:39,575 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:39,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342784529] [2020-02-10 19:39:39,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:39,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:39,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699628611] [2020-02-10 19:39:39,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:39,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:39,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:39,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:39,585 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:39:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:39,822 INFO L93 Difference]: Finished difference Result 6023 states and 26805 transitions. [2020-02-10 19:39:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:39,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:39,838 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 19:39:39,838 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:39:39,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:39:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3125. [2020-02-10 19:39:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:39:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15563 transitions. [2020-02-10 19:39:40,046 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15563 transitions. Word has length 31 [2020-02-10 19:39:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:40,046 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15563 transitions. [2020-02-10 19:39:40,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15563 transitions. [2020-02-10 19:39:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:40,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:40,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:40,052 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1249704454, now seen corresponding path program 471 times [2020-02-10 19:39:40,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:40,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942201810] [2020-02-10 19:39:40,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:40,595 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:39:40,728 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:39:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:40,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942201810] [2020-02-10 19:39:40,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:40,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:40,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463496686] [2020-02-10 19:39:40,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:40,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:40,737 INFO L87 Difference]: Start difference. First operand 3125 states and 15563 transitions. Second operand 12 states. [2020-02-10 19:39:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:40,972 INFO L93 Difference]: Finished difference Result 6028 states and 26814 transitions. [2020-02-10 19:39:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:40,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:40,988 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 19:39:40,988 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:39:40,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:39:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-02-10 19:39:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:39:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15574 transitions. [2020-02-10 19:39:41,202 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15574 transitions. Word has length 31 [2020-02-10 19:39:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:41,202 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15574 transitions. [2020-02-10 19:39:41,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15574 transitions. [2020-02-10 19:39:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:41,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:41,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:41,208 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash -757108692, now seen corresponding path program 472 times [2020-02-10 19:39:41,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:41,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590163791] [2020-02-10 19:39:41,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:41,756 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 19:39:41,886 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 19:39:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:41,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590163791] [2020-02-10 19:39:41,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:41,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:41,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608476805] [2020-02-10 19:39:41,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:41,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:41,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:41,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:41,896 INFO L87 Difference]: Start difference. First operand 3131 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:39:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:42,092 INFO L93 Difference]: Finished difference Result 6034 states and 26820 transitions. [2020-02-10 19:39:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:42,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:42,107 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 19:39:42,107 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:39:42,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:42,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:39:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-02-10 19:39:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:39:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-02-10 19:39:42,323 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-02-10 19:39:42,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:42,323 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-02-10 19:39:42,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-02-10 19:39:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:42,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:42,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:42,328 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash 506697466, now seen corresponding path program 473 times [2020-02-10 19:39:42,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:42,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102237452] [2020-02-10 19:39:42,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:42,884 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:39:43,015 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:43,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 19:39:43,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102237452] [2020-02-10 19:39:43,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:43,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:43,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094926200] [2020-02-10 19:39:43,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:43,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:43,025 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-02-10 19:39:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:43,342 INFO L93 Difference]: Finished difference Result 6031 states and 26815 transitions. [2020-02-10 19:39:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:43,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:43,358 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 19:39:43,358 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 19:39:43,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 19:39:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3132. [2020-02-10 19:39:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:39:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15570 transitions. [2020-02-10 19:39:43,574 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15570 transitions. Word has length 31 [2020-02-10 19:39:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:43,574 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15570 transitions. [2020-02-10 19:39:43,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15570 transitions. [2020-02-10 19:39:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:43,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:43,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:43,579 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1605731164, now seen corresponding path program 474 times [2020-02-10 19:39:43,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:43,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150000716] [2020-02-10 19:39:43,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:44,149 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:44,325 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:44,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150000716] [2020-02-10 19:39:44,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:44,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:44,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573142963] [2020-02-10 19:39:44,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:44,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:44,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:44,335 INFO L87 Difference]: Start difference. First operand 3132 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:39:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:44,528 INFO L93 Difference]: Finished difference Result 6036 states and 26818 transitions. [2020-02-10 19:39:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:44,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:44,544 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:39:44,544 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:39:44,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:39:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-02-10 19:39:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 19:39:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15540 transitions. [2020-02-10 19:39:44,759 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15540 transitions. Word has length 31 [2020-02-10 19:39:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:44,759 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15540 transitions. [2020-02-10 19:39:44,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15540 transitions. [2020-02-10 19:39:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:44,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:44,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:44,765 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1726955480, now seen corresponding path program 475 times [2020-02-10 19:39:44,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:44,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920643703] [2020-02-10 19:39:44,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:45,318 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:45,448 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:45,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920643703] [2020-02-10 19:39:45,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:45,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:45,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658059699] [2020-02-10 19:39:45,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:45,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:45,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:45,458 INFO L87 Difference]: Start difference. First operand 3119 states and 15540 transitions. Second operand 12 states. [2020-02-10 19:39:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:45,693 INFO L93 Difference]: Finished difference Result 6043 states and 26851 transitions. [2020-02-10 19:39:45,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:45,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:45,708 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 19:39:45,708 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 19:39:45,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 19:39:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3133. [2020-02-10 19:39:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:39:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15579 transitions. [2020-02-10 19:39:45,922 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15579 transitions. Word has length 31 [2020-02-10 19:39:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:45,922 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15579 transitions. [2020-02-10 19:39:45,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15579 transitions. [2020-02-10 19:39:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:45,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:45,927 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1723040364, now seen corresponding path program 476 times [2020-02-10 19:39:45,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:45,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910603764] [2020-02-10 19:39:45,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:46,484 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:46,617 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:46,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 19:39:46,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910603764] [2020-02-10 19:39:46,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:46,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:46,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354400694] [2020-02-10 19:39:46,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:46,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:46,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:46,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:46,628 INFO L87 Difference]: Start difference. First operand 3133 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:39:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:46,864 INFO L93 Difference]: Finished difference Result 6040 states and 26839 transitions. [2020-02-10 19:39:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:46,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:46,879 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 19:39:46,879 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 19:39:46,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 19:39:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3127. [2020-02-10 19:39:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:39:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15562 transitions. [2020-02-10 19:39:47,086 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15562 transitions. Word has length 31 [2020-02-10 19:39:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:47,086 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15562 transitions. [2020-02-10 19:39:47,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15562 transitions. [2020-02-10 19:39:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:47,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:47,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:47,092 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1507233726, now seen corresponding path program 477 times [2020-02-10 19:39:47,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:47,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940989206] [2020-02-10 19:39:47,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:47,444 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2020-02-10 19:39:47,791 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:39:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:47,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940989206] [2020-02-10 19:39:47,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:47,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:47,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088761995] [2020-02-10 19:39:47,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:47,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:47,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:47,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:47,802 INFO L87 Difference]: Start difference. First operand 3127 states and 15562 transitions. Second operand 12 states. [2020-02-10 19:39:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:48,085 INFO L93 Difference]: Finished difference Result 6053 states and 26866 transitions. [2020-02-10 19:39:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:48,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:48,100 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:39:48,100 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 19:39:48,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 19:39:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3138. [2020-02-10 19:39:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:39:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15582 transitions. [2020-02-10 19:39:48,316 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15582 transitions. Word has length 31 [2020-02-10 19:39:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:48,316 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15582 transitions. [2020-02-10 19:39:48,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15582 transitions. [2020-02-10 19:39:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:48,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:48,321 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1450166356, now seen corresponding path program 478 times [2020-02-10 19:39:48,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:48,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645053869] [2020-02-10 19:39:48,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:48,899 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:49,033 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:49,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645053869] [2020-02-10 19:39:49,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:49,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:49,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77616460] [2020-02-10 19:39:49,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:49,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:49,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:49,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:49,044 INFO L87 Difference]: Start difference. First operand 3138 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:39:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:49,263 INFO L93 Difference]: Finished difference Result 6055 states and 26860 transitions. [2020-02-10 19:39:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:49,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:49,278 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 19:39:49,278 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 19:39:49,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 19:39:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-02-10 19:39:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:39:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15554 transitions. [2020-02-10 19:39:49,493 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15554 transitions. Word has length 31 [2020-02-10 19:39:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:49,493 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15554 transitions. [2020-02-10 19:39:49,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15554 transitions. [2020-02-10 19:39:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:49,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:49,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:49,498 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 237951038, now seen corresponding path program 479 times [2020-02-10 19:39:49,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:49,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734151708] [2020-02-10 19:39:49,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:50,059 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:39:50,189 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:50,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 19:39:50,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734151708] [2020-02-10 19:39:50,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:50,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:50,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15629735] [2020-02-10 19:39:50,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:50,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:50,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:50,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:50,200 INFO L87 Difference]: Start difference. First operand 3127 states and 15554 transitions. Second operand 12 states. [2020-02-10 19:39:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:50,429 INFO L93 Difference]: Finished difference Result 6043 states and 26836 transitions. [2020-02-10 19:39:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:50,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:50,444 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 19:39:50,444 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:39:50,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:39:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3134. [2020-02-10 19:39:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:39:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15567 transitions. [2020-02-10 19:39:50,650 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15567 transitions. Word has length 31 [2020-02-10 19:39:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:50,650 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15567 transitions. [2020-02-10 19:39:50,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15567 transitions. [2020-02-10 19:39:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:50,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:50,656 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1874477592, now seen corresponding path program 480 times [2020-02-10 19:39:50,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:50,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166520954] [2020-02-10 19:39:50,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:51,215 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:39:51,342 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:39:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:51,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166520954] [2020-02-10 19:39:51,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:51,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:51,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441838540] [2020-02-10 19:39:51,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:51,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:51,353 INFO L87 Difference]: Start difference. First operand 3134 states and 15567 transitions. Second operand 12 states. [2020-02-10 19:39:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:51,686 INFO L93 Difference]: Finished difference Result 6048 states and 26839 transitions. [2020-02-10 19:39:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:51,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:51,701 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 19:39:51,701 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 19:39:51,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 19:39:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3104. [2020-02-10 19:39:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 19:39:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15505 transitions. [2020-02-10 19:39:51,915 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15505 transitions. Word has length 31 [2020-02-10 19:39:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:51,915 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15505 transitions. [2020-02-10 19:39:51,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15505 transitions. [2020-02-10 19:39:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:51,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:51,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:51,920 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:51,921 INFO L82 PathProgramCache]: Analyzing trace with hash 727124524, now seen corresponding path program 481 times [2020-02-10 19:39:51,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:51,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761547206] [2020-02-10 19:39:51,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:52,499 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:39:52,633 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:39:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:52,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761547206] [2020-02-10 19:39:52,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:52,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274937174] [2020-02-10 19:39:52,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:52,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:52,643 INFO L87 Difference]: Start difference. First operand 3104 states and 15505 transitions. Second operand 12 states. [2020-02-10 19:39:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:52,937 INFO L93 Difference]: Finished difference Result 5985 states and 26750 transitions. [2020-02-10 19:39:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:52,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:52,952 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 19:39:52,952 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 19:39:52,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 19:39:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3125. [2020-02-10 19:39:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:39:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 19:39:53,164 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 19:39:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:53,164 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 19:39:53,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 19:39:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:53,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:53,169 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 304638798, now seen corresponding path program 482 times [2020-02-10 19:39:53,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:53,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769593457] [2020-02-10 19:39:53,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:53,700 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:39:53,835 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:39:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:53,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769593457] [2020-02-10 19:39:53,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:53,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:53,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895523888] [2020-02-10 19:39:53,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:53,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:53,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:53,846 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 19:39:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:54,206 INFO L93 Difference]: Finished difference Result 5982 states and 26739 transitions. [2020-02-10 19:39:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:54,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:54,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:54,222 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 19:39:54,222 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 19:39:54,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 19:39:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3120. [2020-02-10 19:39:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:39:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-02-10 19:39:54,437 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-02-10 19:39:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:54,437 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-02-10 19:39:54,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-02-10 19:39:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:54,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:54,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:54,442 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash -121497948, now seen corresponding path program 483 times [2020-02-10 19:39:54,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:54,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193816252] [2020-02-10 19:39:54,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:54,983 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:39:55,115 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:55,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193816252] [2020-02-10 19:39:55,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:55,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:55,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093037630] [2020-02-10 19:39:55,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:55,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:55,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:55,126 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:39:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:55,488 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-02-10 19:39:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:55,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:55,503 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 19:39:55,503 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:39:55,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:39:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3126. [2020-02-10 19:39:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:39:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 19:39:55,718 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 19:39:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:55,718 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 19:39:55,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 19:39:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:55,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:55,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:55,723 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2061040718, now seen corresponding path program 484 times [2020-02-10 19:39:55,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:55,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709323715] [2020-02-10 19:39:55,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:56,257 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:56,389 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:56,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709323715] [2020-02-10 19:39:56,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:56,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:56,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157113871] [2020-02-10 19:39:56,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:56,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:56,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:56,399 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:39:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:56,766 INFO L93 Difference]: Finished difference Result 5985 states and 26740 transitions. [2020-02-10 19:39:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:56,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:56,781 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 19:39:56,781 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 19:39:56,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 19:39:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3120. [2020-02-10 19:39:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:39:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 19:39:56,987 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 19:39:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:56,988 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 19:39:56,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 19:39:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:56,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:56,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:56,993 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:56,993 INFO L82 PathProgramCache]: Analyzing trace with hash -756139292, now seen corresponding path program 485 times [2020-02-10 19:39:56,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:56,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116993971] [2020-02-10 19:39:56,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:57,551 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:39:57,684 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:39:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:57,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116993971] [2020-02-10 19:39:57,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:57,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:57,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131914716] [2020-02-10 19:39:57,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:57,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:57,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:57,695 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:39:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:57,917 INFO L93 Difference]: Finished difference Result 5980 states and 26730 transitions. [2020-02-10 19:39:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:57,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:57,932 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:39:57,932 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 19:39:57,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 19:39:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-02-10 19:39:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:39:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15581 transitions. [2020-02-10 19:39:58,139 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15581 transitions. Word has length 31 [2020-02-10 19:39:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:58,139 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15581 transitions. [2020-02-10 19:39:58,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15581 transitions. [2020-02-10 19:39:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:58,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:58,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:58,144 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:58,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1848885100, now seen corresponding path program 486 times [2020-02-10 19:39:58,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:58,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080988139] [2020-02-10 19:39:58,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:58,724 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:39:58,852 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:58,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080988139] [2020-02-10 19:39:58,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:58,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:58,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917806176] [2020-02-10 19:39:58,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:58,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:58,863 INFO L87 Difference]: Start difference. First operand 3125 states and 15581 transitions. Second operand 12 states. [2020-02-10 19:39:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:39:59,086 INFO L93 Difference]: Finished difference Result 5981 states and 26727 transitions. [2020-02-10 19:39:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:39:59,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:39:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:39:59,101 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 19:39:59,101 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 19:39:59,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:39:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 19:39:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3115. [2020-02-10 19:39:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:39:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15558 transitions. [2020-02-10 19:39:59,309 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15558 transitions. Word has length 31 [2020-02-10 19:39:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:39:59,309 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15558 transitions. [2020-02-10 19:39:59,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:39:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15558 transitions. [2020-02-10 19:39:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:39:59,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:39:59,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:39:59,314 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:39:59,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:39:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash 458378096, now seen corresponding path program 487 times [2020-02-10 19:39:59,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:39:59,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288958493] [2020-02-10 19:39:59,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:39:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:39:59,854 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:39:59,986 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:39:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:39:59,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288958493] [2020-02-10 19:39:59,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:39:59,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:39:59,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470898386] [2020-02-10 19:39:59,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:39:59,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:39:59,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:39:59,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:39:59,995 INFO L87 Difference]: Start difference. First operand 3115 states and 15558 transitions. Second operand 12 states. [2020-02-10 19:40:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:00,219 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-02-10 19:40:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:00,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:00,234 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 19:40:00,234 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:40:00,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:40:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3125. [2020-02-10 19:40:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:40:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-02-10 19:40:00,443 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-02-10 19:40:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:00,443 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-02-10 19:40:00,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-02-10 19:40:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:00,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:00,448 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash 35892370, now seen corresponding path program 488 times [2020-02-10 19:40:00,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:00,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642433381] [2020-02-10 19:40:00,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:00,916 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2020-02-10 19:40:01,162 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:01,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642433381] [2020-02-10 19:40:01,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:01,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:01,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835084786] [2020-02-10 19:40:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:01,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:01,173 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:40:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:01,392 INFO L93 Difference]: Finished difference Result 5984 states and 26739 transitions. [2020-02-10 19:40:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:01,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:01,407 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 19:40:01,407 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 19:40:01,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 19:40:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3120. [2020-02-10 19:40:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:40:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 19:40:01,627 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 19:40:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:01,627 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 19:40:01,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 19:40:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:01,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:01,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:01,633 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash -814555612, now seen corresponding path program 489 times [2020-02-10 19:40:01,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:01,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482251881] [2020-02-10 19:40:01,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:02,196 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:02,329 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:02,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482251881] [2020-02-10 19:40:02,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:02,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:02,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755275791] [2020-02-10 19:40:02,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:02,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:02,340 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:40:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:02,567 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-02-10 19:40:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:02,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:02,583 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 19:40:02,584 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 19:40:02,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 19:40:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 19:40:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:40:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15585 transitions. [2020-02-10 19:40:02,806 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15585 transitions. Word has length 31 [2020-02-10 19:40:02,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:02,806 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15585 transitions. [2020-02-10 19:40:02,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15585 transitions. [2020-02-10 19:40:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:02,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:02,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:02,812 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash 523011602, now seen corresponding path program 490 times [2020-02-10 19:40:02,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:02,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100462649] [2020-02-10 19:40:02,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:03,481 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:03,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 19:40:03,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100462649] [2020-02-10 19:40:03,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:03,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:03,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913943065] [2020-02-10 19:40:03,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:03,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:03,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:03,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:03,490 INFO L87 Difference]: Start difference. First operand 3127 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:40:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:03,716 INFO L93 Difference]: Finished difference Result 5990 states and 26746 transitions. [2020-02-10 19:40:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:03,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:03,731 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 19:40:03,731 INFO L226 Difference]: Without dead ends: 5965 [2020-02-10 19:40:03,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-02-10 19:40:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3120. [2020-02-10 19:40:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:40:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15567 transitions. [2020-02-10 19:40:03,971 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15567 transitions. Word has length 31 [2020-02-10 19:40:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:03,972 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15567 transitions. [2020-02-10 19:40:03,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15567 transitions. [2020-02-10 19:40:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:03,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:03,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:03,977 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:03,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1449196956, now seen corresponding path program 491 times [2020-02-10 19:40:03,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:03,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244380544] [2020-02-10 19:40:03,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:04,516 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:04,650 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:04,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244380544] [2020-02-10 19:40:04,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:04,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:04,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835176567] [2020-02-10 19:40:04,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:04,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:04,659 INFO L87 Difference]: Start difference. First operand 3120 states and 15567 transitions. Second operand 12 states. [2020-02-10 19:40:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:04,890 INFO L93 Difference]: Finished difference Result 5983 states and 26732 transitions. [2020-02-10 19:40:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:04,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:04,906 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 19:40:04,906 INFO L226 Difference]: Without dead ends: 5967 [2020-02-10 19:40:04,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-02-10 19:40:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3125. [2020-02-10 19:40:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:40:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 19:40:05,122 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 19:40:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:05,122 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 19:40:05,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 19:40:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:05,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:05,127 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 310855984, now seen corresponding path program 492 times [2020-02-10 19:40:05,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:05,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307926138] [2020-02-10 19:40:05,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:05,662 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:05,791 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:05,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307926138] [2020-02-10 19:40:05,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:05,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:05,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801806716] [2020-02-10 19:40:05,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:05,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:05,802 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:40:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:06,070 INFO L93 Difference]: Finished difference Result 5985 states and 26731 transitions. [2020-02-10 19:40:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:06,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:06,086 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 19:40:06,086 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 19:40:06,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 19:40:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3115. [2020-02-10 19:40:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:40:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15553 transitions. [2020-02-10 19:40:06,293 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15553 transitions. Word has length 31 [2020-02-10 19:40:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:06,293 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15553 transitions. [2020-02-10 19:40:06,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15553 transitions. [2020-02-10 19:40:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:06,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:06,299 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash -927737232, now seen corresponding path program 493 times [2020-02-10 19:40:06,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:06,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263243426] [2020-02-10 19:40:06,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:06,851 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:40:06,983 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:06,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263243426] [2020-02-10 19:40:06,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:06,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:06,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920946116] [2020-02-10 19:40:06,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:06,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:06,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:06,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:06,994 INFO L87 Difference]: Start difference. First operand 3115 states and 15553 transitions. Second operand 12 states. [2020-02-10 19:40:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:07,217 INFO L93 Difference]: Finished difference Result 5993 states and 26762 transitions. [2020-02-10 19:40:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:07,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:07,232 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 19:40:07,232 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 19:40:07,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 19:40:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-02-10 19:40:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:40:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 19:40:07,440 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 19:40:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:07,440 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 19:40:07,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 19:40:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:07,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:07,445 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:07,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1254801434, now seen corresponding path program 494 times [2020-02-10 19:40:07,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:07,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332504997] [2020-02-10 19:40:07,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:07,988 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:08,111 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:08,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332504997] [2020-02-10 19:40:08,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:08,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:08,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951113512] [2020-02-10 19:40:08,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:08,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:08,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:08,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:08,121 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:40:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:08,344 INFO L93 Difference]: Finished difference Result 5991 states and 26752 transitions. [2020-02-10 19:40:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:08,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:08,359 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 19:40:08,359 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:40:08,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:40:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 19:40:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:40:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 19:40:08,576 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 19:40:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:08,576 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 19:40:08,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 19:40:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:08,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:08,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:08,581 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1352048468, now seen corresponding path program 495 times [2020-02-10 19:40:08,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:08,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800014851] [2020-02-10 19:40:08,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:09,185 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:40:09,310 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:40:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:09,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800014851] [2020-02-10 19:40:09,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:09,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:09,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280653312] [2020-02-10 19:40:09,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:09,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:09,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:09,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:09,321 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:40:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:09,576 INFO L93 Difference]: Finished difference Result 5995 states and 26761 transitions. [2020-02-10 19:40:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:09,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:09,591 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 19:40:09,591 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 19:40:09,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 19:40:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-02-10 19:40:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:40:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 19:40:09,805 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 19:40:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:09,805 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 19:40:09,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 19:40:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:09,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:09,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:09,811 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash -14481254, now seen corresponding path program 496 times [2020-02-10 19:40:09,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:09,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844119100] [2020-02-10 19:40:09,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:10,376 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:10,507 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:40:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:10,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844119100] [2020-02-10 19:40:10,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:10,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:10,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988358119] [2020-02-10 19:40:10,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:10,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:10,517 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:40:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:10,746 INFO L93 Difference]: Finished difference Result 5994 states and 26752 transitions. [2020-02-10 19:40:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:10,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:10,761 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 19:40:10,762 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 19:40:10,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 19:40:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 19:40:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:40:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15564 transitions. [2020-02-10 19:40:10,975 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15564 transitions. Word has length 31 [2020-02-10 19:40:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:10,975 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15564 transitions. [2020-02-10 19:40:10,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15564 transitions. [2020-02-10 19:40:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:10,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:10,980 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash -230287892, now seen corresponding path program 497 times [2020-02-10 19:40:10,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:10,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411811691] [2020-02-10 19:40:10,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:11,532 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:11,662 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:40:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:11,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411811691] [2020-02-10 19:40:11,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:11,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:11,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955359035] [2020-02-10 19:40:11,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:11,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:11,672 INFO L87 Difference]: Start difference. First operand 3121 states and 15564 transitions. Second operand 12 states. [2020-02-10 19:40:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:11,899 INFO L93 Difference]: Finished difference Result 5990 states and 26744 transitions. [2020-02-10 19:40:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:11,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:11,915 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 19:40:11,915 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 19:40:11,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 19:40:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3127. [2020-02-10 19:40:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:40:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15575 transitions. [2020-02-10 19:40:12,129 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15575 transitions. Word has length 31 [2020-02-10 19:40:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:12,130 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15575 transitions. [2020-02-10 19:40:12,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15575 transitions. [2020-02-10 19:40:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:12,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:12,135 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:12,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1075259344, now seen corresponding path program 498 times [2020-02-10 19:40:12,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:12,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143703971] [2020-02-10 19:40:12,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:12,673 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:12,805 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:40:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:12,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143703971] [2020-02-10 19:40:12,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:12,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:12,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544259560] [2020-02-10 19:40:12,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:12,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:12,816 INFO L87 Difference]: Start difference. First operand 3127 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:40:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:13,047 INFO L93 Difference]: Finished difference Result 5991 states and 26740 transitions. [2020-02-10 19:40:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:13,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:13,062 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 19:40:13,063 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 19:40:13,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 19:40:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3115. [2020-02-10 19:40:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:40:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15548 transitions. [2020-02-10 19:40:13,270 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15548 transitions. Word has length 31 [2020-02-10 19:40:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:13,270 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15548 transitions. [2020-02-10 19:40:13,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15548 transitions. [2020-02-10 19:40:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:13,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:13,275 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash 450731858, now seen corresponding path program 499 times [2020-02-10 19:40:13,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:13,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603992991] [2020-02-10 19:40:13,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:13,837 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:13,969 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:40:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:13,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603992991] [2020-02-10 19:40:13,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:13,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:13,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42887395] [2020-02-10 19:40:13,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:13,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:13,979 INFO L87 Difference]: Start difference. First operand 3115 states and 15548 transitions. Second operand 12 states. [2020-02-10 19:40:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:14,226 INFO L93 Difference]: Finished difference Result 5979 states and 26723 transitions. [2020-02-10 19:40:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:14,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:14,242 INFO L225 Difference]: With dead ends: 5979 [2020-02-10 19:40:14,242 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 19:40:14,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 19:40:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3125. [2020-02-10 19:40:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:40:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 19:40:14,448 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 19:40:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:14,448 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 19:40:14,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 19:40:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:14,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:14,453 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:14,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:14,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1239211046, now seen corresponding path program 500 times [2020-02-10 19:40:14,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:14,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739393970] [2020-02-10 19:40:14,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:14,999 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:15,130 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:40:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:15,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739393970] [2020-02-10 19:40:15,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:15,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:15,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045867935] [2020-02-10 19:40:15,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:15,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:15,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:15,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:15,140 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:40:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:15,371 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-02-10 19:40:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:15,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:15,385 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:40:15,385 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 19:40:15,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 19:40:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3120. [2020-02-10 19:40:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:40:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-02-10 19:40:15,592 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-02-10 19:40:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:15,592 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-02-10 19:40:15,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-02-10 19:40:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:15,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:15,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:15,597 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash 26420622, now seen corresponding path program 501 times [2020-02-10 19:40:15,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:15,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326012230] [2020-02-10 19:40:15,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:16,145 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:16,277 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:16,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326012230] [2020-02-10 19:40:16,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:16,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:16,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161555570] [2020-02-10 19:40:16,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:16,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:16,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:16,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:16,287 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-02-10 19:40:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:16,588 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-02-10 19:40:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:16,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:16,603 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 19:40:16,603 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 19:40:16,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 19:40:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-02-10 19:40:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:40:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 19:40:16,814 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 19:40:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:16,814 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 19:40:16,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 19:40:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:16,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:16,819 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:16,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1786473562, now seen corresponding path program 502 times [2020-02-10 19:40:16,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:16,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496708441] [2020-02-10 19:40:16,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:17,369 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:17,549 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:17,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496708441] [2020-02-10 19:40:17,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:17,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:17,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272105400] [2020-02-10 19:40:17,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:17,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:17,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:17,560 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:40:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:17,840 INFO L93 Difference]: Finished difference Result 5982 states and 26719 transitions. [2020-02-10 19:40:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:17,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:17,855 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 19:40:17,855 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 19:40:17,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 19:40:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3120. [2020-02-10 19:40:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 19:40:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15557 transitions. [2020-02-10 19:40:18,067 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15557 transitions. Word has length 31 [2020-02-10 19:40:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:18,067 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15557 transitions. [2020-02-10 19:40:18,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15557 transitions. [2020-02-10 19:40:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:18,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:18,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:18,073 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:18,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:18,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1782822542, now seen corresponding path program 503 times [2020-02-10 19:40:18,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:18,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886004800] [2020-02-10 19:40:18,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:18,625 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:18,756 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:40:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:18,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886004800] [2020-02-10 19:40:18,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:18,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:18,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309077279] [2020-02-10 19:40:18,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:18,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:18,767 INFO L87 Difference]: Start difference. First operand 3120 states and 15557 transitions. Second operand 12 states. [2020-02-10 19:40:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:19,085 INFO L93 Difference]: Finished difference Result 5983 states and 26722 transitions. [2020-02-10 19:40:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:19,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:19,100 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 19:40:19,101 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 19:40:19,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 19:40:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3126. [2020-02-10 19:40:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:40:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-02-10 19:40:19,318 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-02-10 19:40:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:19,318 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-02-10 19:40:19,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-02-10 19:40:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:19,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:19,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:19,323 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 937851090, now seen corresponding path program 504 times [2020-02-10 19:40:19,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:19,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763212936] [2020-02-10 19:40:19,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:19,869 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:20,001 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:40:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:20,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763212936] [2020-02-10 19:40:20,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:20,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:20,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123565505] [2020-02-10 19:40:20,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:20,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:20,012 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:40:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:20,251 INFO L93 Difference]: Finished difference Result 5984 states and 26718 transitions. [2020-02-10 19:40:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:20,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:20,266 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 19:40:20,266 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 19:40:20,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 19:40:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3110. [2020-02-10 19:40:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 19:40:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15534 transitions. [2020-02-10 19:40:20,474 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15534 transitions. Word has length 31 [2020-02-10 19:40:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:20,474 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15534 transitions. [2020-02-10 19:40:20,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15534 transitions. [2020-02-10 19:40:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:20,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:20,479 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1032166138, now seen corresponding path program 505 times [2020-02-10 19:40:20,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:20,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800886602] [2020-02-10 19:40:20,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:21,005 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:40:21,136 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:21,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800886602] [2020-02-10 19:40:21,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:21,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:21,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073445582] [2020-02-10 19:40:21,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:21,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:21,147 INFO L87 Difference]: Start difference. First operand 3110 states and 15534 transitions. Second operand 12 states. [2020-02-10 19:40:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:21,465 INFO L93 Difference]: Finished difference Result 5997 states and 26774 transitions. [2020-02-10 19:40:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:21,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:21,481 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 19:40:21,481 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 19:40:21,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 19:40:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3126. [2020-02-10 19:40:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:40:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15590 transitions. [2020-02-10 19:40:21,688 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15590 transitions. Word has length 31 [2020-02-10 19:40:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:21,688 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15590 transitions. [2020-02-10 19:40:21,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15590 transitions. [2020-02-10 19:40:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:21,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:21,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:21,694 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:21,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1454651864, now seen corresponding path program 506 times [2020-02-10 19:40:21,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:21,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032906173] [2020-02-10 19:40:21,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:22,230 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:40:22,359 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:22,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032906173] [2020-02-10 19:40:22,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:22,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:22,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081269483] [2020-02-10 19:40:22,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:22,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:22,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:22,369 INFO L87 Difference]: Start difference. First operand 3126 states and 15590 transitions. Second operand 12 states. [2020-02-10 19:40:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:22,616 INFO L93 Difference]: Finished difference Result 5994 states and 26763 transitions. [2020-02-10 19:40:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:22,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:22,632 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 19:40:22,632 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 19:40:22,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 19:40:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3121. [2020-02-10 19:40:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:40:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-02-10 19:40:22,848 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-02-10 19:40:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:22,848 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-02-10 19:40:22,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-02-10 19:40:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:22,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:22,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:22,854 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1880788610, now seen corresponding path program 507 times [2020-02-10 19:40:22,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:22,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798058900] [2020-02-10 19:40:22,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:23,386 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:40:23,520 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:23,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798058900] [2020-02-10 19:40:23,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:23,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:23,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312078938] [2020-02-10 19:40:23,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:23,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:23,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:23,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:23,531 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:40:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:23,795 INFO L93 Difference]: Finished difference Result 5999 states and 26774 transitions. [2020-02-10 19:40:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:23,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:23,810 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 19:40:23,810 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 19:40:23,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 19:40:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-02-10 19:40:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:40:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 19:40:24,022 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 19:40:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:24,022 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 19:40:24,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 19:40:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:24,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:24,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:24,028 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash 301750056, now seen corresponding path program 508 times [2020-02-10 19:40:24,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:24,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411695252] [2020-02-10 19:40:24,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:24,557 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:24,689 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:24,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411695252] [2020-02-10 19:40:24,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:24,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:24,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792038827] [2020-02-10 19:40:24,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:24,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:24,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:24,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:24,700 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:40:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:24,979 INFO L93 Difference]: Finished difference Result 5997 states and 26764 transitions. [2020-02-10 19:40:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:24,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:24,993 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 19:40:24,993 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 19:40:24,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 19:40:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3121. [2020-02-10 19:40:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:40:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15571 transitions. [2020-02-10 19:40:25,205 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15571 transitions. Word has length 31 [2020-02-10 19:40:25,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:25,206 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15571 transitions. [2020-02-10 19:40:25,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15571 transitions. [2020-02-10 19:40:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:25,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:25,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:25,211 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1779537342, now seen corresponding path program 509 times [2020-02-10 19:40:25,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:25,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786896755] [2020-02-10 19:40:25,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:25,807 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:40:25,936 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:25,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 19:40:25,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786896755] [2020-02-10 19:40:25,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:25,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:25,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775122078] [2020-02-10 19:40:25,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:25,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:25,947 INFO L87 Difference]: Start difference. First operand 3121 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:40:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:26,181 INFO L93 Difference]: Finished difference Result 5992 states and 26754 transitions. [2020-02-10 19:40:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:26,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:26,196 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 19:40:26,196 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 19:40:26,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 19:40:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3126. [2020-02-10 19:40:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:40:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15580 transitions. [2020-02-10 19:40:26,403 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15580 transitions. Word has length 31 [2020-02-10 19:40:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:26,403 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15580 transitions. [2020-02-10 19:40:26,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15580 transitions. [2020-02-10 19:40:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:26,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:26,408 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash 89594438, now seen corresponding path program 510 times [2020-02-10 19:40:26,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:26,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766897665] [2020-02-10 19:40:26,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:26,954 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:27,086 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:27,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766897665] [2020-02-10 19:40:27,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:27,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:27,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679230955] [2020-02-10 19:40:27,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:27,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:27,096 INFO L87 Difference]: Start difference. First operand 3126 states and 15580 transitions. Second operand 12 states. [2020-02-10 19:40:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:27,333 INFO L93 Difference]: Finished difference Result 5993 states and 26751 transitions. [2020-02-10 19:40:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:27,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:27,349 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 19:40:27,349 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 19:40:27,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 19:40:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3116. [2020-02-10 19:40:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:40:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15557 transitions. [2020-02-10 19:40:27,556 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15557 transitions. Word has length 31 [2020-02-10 19:40:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:27,557 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15557 transitions. [2020-02-10 19:40:27,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15557 transitions. [2020-02-10 19:40:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:27,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:27,562 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 443451440, now seen corresponding path program 511 times [2020-02-10 19:40:27,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:27,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659014165] [2020-02-10 19:40:27,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:28,092 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:40:28,225 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:28,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659014165] [2020-02-10 19:40:28,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:28,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:28,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480284754] [2020-02-10 19:40:28,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:28,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:28,235 INFO L87 Difference]: Start difference. First operand 3116 states and 15557 transitions. Second operand 12 states. [2020-02-10 19:40:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:28,461 INFO L93 Difference]: Finished difference Result 6007 states and 26791 transitions. [2020-02-10 19:40:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:28,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:28,476 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 19:40:28,476 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:40:28,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:40:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3127. [2020-02-10 19:40:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:40:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-02-10 19:40:28,683 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-02-10 19:40:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:28,683 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-02-10 19:40:28,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-02-10 19:40:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:28,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:28,688 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash 20965714, now seen corresponding path program 512 times [2020-02-10 19:40:28,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:28,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136632233] [2020-02-10 19:40:28,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:29,205 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:40:29,340 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:29,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136632233] [2020-02-10 19:40:29,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:29,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:29,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864068513] [2020-02-10 19:40:29,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:29,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:29,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:29,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:29,349 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:40:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:29,665 INFO L93 Difference]: Finished difference Result 6004 states and 26780 transitions. [2020-02-10 19:40:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:29,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:29,680 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 19:40:29,680 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 19:40:29,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 19:40:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-02-10 19:40:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:40:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15574 transitions. [2020-02-10 19:40:29,887 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15574 transitions. Word has length 31 [2020-02-10 19:40:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:29,887 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15574 transitions. [2020-02-10 19:40:29,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15574 transitions. [2020-02-10 19:40:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:29,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:29,892 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1465949122, now seen corresponding path program 513 times [2020-02-10 19:40:29,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:29,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132524251] [2020-02-10 19:40:29,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:30,428 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:40:30,564 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:30,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132524251] [2020-02-10 19:40:30,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:30,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:30,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070060008] [2020-02-10 19:40:30,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:30,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:30,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:30,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:30,574 INFO L87 Difference]: Start difference. First operand 3122 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:40:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:30,847 INFO L93 Difference]: Finished difference Result 6017 states and 26808 transitions. [2020-02-10 19:40:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:30,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:30,862 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 19:40:30,862 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:40:30,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:40:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3131. [2020-02-10 19:40:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:40:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-02-10 19:40:31,078 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-02-10 19:40:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:31,078 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-02-10 19:40:31,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-02-10 19:40:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:31,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:31,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:31,083 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1395839086, now seen corresponding path program 514 times [2020-02-10 19:40:31,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:31,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280198065] [2020-02-10 19:40:31,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:31,631 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:40:31,765 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:31,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 19:40:31,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280198065] [2020-02-10 19:40:31,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:31,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:31,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075504238] [2020-02-10 19:40:31,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:31,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:31,775 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-02-10 19:40:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:31,989 INFO L93 Difference]: Finished difference Result 6020 states and 26805 transitions. [2020-02-10 19:40:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:31,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:32,004 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 19:40:32,004 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 19:40:32,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 19:40:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3122. [2020-02-10 19:40:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:40:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 19:40:32,210 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 19:40:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:32,210 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 19:40:32,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 19:40:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:32,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:32,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:32,216 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2100590466, now seen corresponding path program 515 times [2020-02-10 19:40:32,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:32,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466642675] [2020-02-10 19:40:32,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:32,753 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:40:32,887 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:32,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466642675] [2020-02-10 19:40:32,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:32,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:32,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82994802] [2020-02-10 19:40:32,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:32,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:32,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:32,898 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:40:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:33,181 INFO L93 Difference]: Finished difference Result 6008 states and 26781 transitions. [2020-02-10 19:40:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:33,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:33,196 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 19:40:33,196 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:40:33,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:40:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3128. [2020-02-10 19:40:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:40:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-02-10 19:40:33,403 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-02-10 19:40:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:33,403 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-02-10 19:40:33,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-02-10 19:40:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:33,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:33,408 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:33,408 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1607994704, now seen corresponding path program 516 times [2020-02-10 19:40:33,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:33,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346830773] [2020-02-10 19:40:33,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:33,936 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:40:34,111 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:34,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346830773] [2020-02-10 19:40:34,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:34,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:34,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275348009] [2020-02-10 19:40:34,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:34,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:34,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:34,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:34,120 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-02-10 19:40:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:34,340 INFO L93 Difference]: Finished difference Result 6014 states and 26787 transitions. [2020-02-10 19:40:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:34,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:34,354 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 19:40:34,355 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 19:40:34,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 19:40:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3116. [2020-02-10 19:40:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:40:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-02-10 19:40:34,568 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-02-10 19:40:34,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:34,568 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-02-10 19:40:34,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-02-10 19:40:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:34,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:34,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:34,574 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash -942663888, now seen corresponding path program 517 times [2020-02-10 19:40:34,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:34,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013530538] [2020-02-10 19:40:34,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:35,100 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:40:35,232 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:35,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 19:40:35,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013530538] [2020-02-10 19:40:35,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:35,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:35,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578831499] [2020-02-10 19:40:35,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:35,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:35,241 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-02-10 19:40:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:35,481 INFO L93 Difference]: Finished difference Result 6013 states and 26802 transitions. [2020-02-10 19:40:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:35,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:35,496 INFO L225 Difference]: With dead ends: 6013 [2020-02-10 19:40:35,497 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 19:40:35,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 19:40:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3129. [2020-02-10 19:40:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:40:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 19:40:35,720 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 19:40:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:35,720 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 19:40:35,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 19:40:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:35,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:35,725 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:35,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1239874778, now seen corresponding path program 518 times [2020-02-10 19:40:35,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:35,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249018092] [2020-02-10 19:40:35,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:36,261 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:36,388 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:36,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249018092] [2020-02-10 19:40:36,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:36,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:36,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141526559] [2020-02-10 19:40:36,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:36,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:36,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:36,399 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:40:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:36,649 INFO L93 Difference]: Finished difference Result 6011 states and 26792 transitions. [2020-02-10 19:40:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:36,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:36,664 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 19:40:36,664 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:40:36,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:40:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3123. [2020-02-10 19:40:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:40:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15571 transitions. [2020-02-10 19:40:36,872 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15571 transitions. Word has length 31 [2020-02-10 19:40:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:36,872 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15571 transitions. [2020-02-10 19:40:36,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15571 transitions. [2020-02-10 19:40:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:36,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:36,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:36,877 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2003441978, now seen corresponding path program 519 times [2020-02-10 19:40:36,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:36,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976039406] [2020-02-10 19:40:36,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:37,420 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:40:37,549 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:37,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976039406] [2020-02-10 19:40:37,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:37,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:37,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934926443] [2020-02-10 19:40:37,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:37,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:37,559 INFO L87 Difference]: Start difference. First operand 3123 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:40:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:37,817 INFO L93 Difference]: Finished difference Result 6021 states and 26813 transitions. [2020-02-10 19:40:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:37,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:37,831 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 19:40:37,831 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 19:40:37,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 19:40:38,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3132. [2020-02-10 19:40:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:40:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15588 transitions. [2020-02-10 19:40:38,039 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15588 transitions. Word has length 31 [2020-02-10 19:40:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:38,040 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15588 transitions. [2020-02-10 19:40:38,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15588 transitions. [2020-02-10 19:40:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:38,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:38,045 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:38,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1933331942, now seen corresponding path program 520 times [2020-02-10 19:40:38,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:38,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796073000] [2020-02-10 19:40:38,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:38,593 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:40:38,721 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:38,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796073000] [2020-02-10 19:40:38,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:38,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:38,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162605899] [2020-02-10 19:40:38,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:38,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:38,731 INFO L87 Difference]: Start difference. First operand 3132 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:40:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:38,979 INFO L93 Difference]: Finished difference Result 6024 states and 26810 transitions. [2020-02-10 19:40:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:38,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:38,994 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 19:40:38,994 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 19:40:38,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 19:40:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-02-10 19:40:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:40:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15564 transitions. [2020-02-10 19:40:39,209 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15564 transitions. Word has length 31 [2020-02-10 19:40:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:39,209 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15564 transitions. [2020-02-10 19:40:39,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15564 transitions. [2020-02-10 19:40:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:39,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:39,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:39,215 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash -881681402, now seen corresponding path program 521 times [2020-02-10 19:40:39,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:39,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529963320] [2020-02-10 19:40:39,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:39,762 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:39,892 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:39,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529963320] [2020-02-10 19:40:39,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:39,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:39,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856317066] [2020-02-10 19:40:39,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:39,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:39,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:39,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:39,902 INFO L87 Difference]: Start difference. First operand 3123 states and 15564 transitions. Second operand 12 states. [2020-02-10 19:40:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:40,168 INFO L93 Difference]: Finished difference Result 6015 states and 26792 transitions. [2020-02-10 19:40:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:40,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:40,182 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 19:40:40,183 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:40:40,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:40:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-02-10 19:40:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:40:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-02-10 19:40:40,391 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-02-10 19:40:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:40,391 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-02-10 19:40:40,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-02-10 19:40:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:40,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:40,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:40,396 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1300857264, now seen corresponding path program 522 times [2020-02-10 19:40:40,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:40,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550869673] [2020-02-10 19:40:40,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:40,939 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:40:41,068 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40: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 19:40:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550869673] [2020-02-10 19:40:41,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:41,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:41,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117282838] [2020-02-10 19:40:41,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:41,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:41,079 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:40:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:41,356 INFO L93 Difference]: Finished difference Result 6020 states and 26795 transitions. [2020-02-10 19:40:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:41,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:41,371 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 19:40:41,371 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 19:40:41,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 19:40:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-02-10 19:40:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:40:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-02-10 19:40:41,585 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-02-10 19:40:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:41,585 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-02-10 19:40:41,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-02-10 19:40:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:41,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:41,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:41,590 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 435805202, now seen corresponding path program 523 times [2020-02-10 19:40:41,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:41,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27876300] [2020-02-10 19:40:41,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:42,135 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:40:42,269 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:42,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27876300] [2020-02-10 19:40:42,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:42,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:42,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608011318] [2020-02-10 19:40:42,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:42,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:42,278 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-02-10 19:40:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:42,577 INFO L93 Difference]: Finished difference Result 5998 states and 26759 transitions. [2020-02-10 19:40:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:42,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:42,593 INFO L225 Difference]: With dead ends: 5998 [2020-02-10 19:40:42,594 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 19:40:42,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 19:40:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3127. [2020-02-10 19:40:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:40:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-02-10 19:40:42,806 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-02-10 19:40:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:42,806 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-02-10 19:40:42,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-02-10 19:40:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:42,811 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:42,811 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:42,811 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1254137702, now seen corresponding path program 524 times [2020-02-10 19:40:42,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:42,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125985262] [2020-02-10 19:40:42,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:43,346 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:43,476 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:43,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125985262] [2020-02-10 19:40:43,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:43,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:43,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782739188] [2020-02-10 19:40:43,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:43,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:43,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:43,486 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-02-10 19:40:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:43,844 INFO L93 Difference]: Finished difference Result 5999 states and 26756 transitions. [2020-02-10 19:40:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:43,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:43,859 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 19:40:43,859 INFO L226 Difference]: Without dead ends: 5977 [2020-02-10 19:40:43,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2020-02-10 19:40:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 3122. [2020-02-10 19:40:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:40:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-02-10 19:40:44,067 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-02-10 19:40:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:44,067 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-02-10 19:40:44,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-02-10 19:40:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:44,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:44,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:44,073 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -624972888, now seen corresponding path program 525 times [2020-02-10 19:40:44,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:44,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774749181] [2020-02-10 19:40:44,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:44,594 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 19:40:44,724 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:44,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774749181] [2020-02-10 19:40:44,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:44,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:44,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158286968] [2020-02-10 19:40:44,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:44,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:44,733 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-02-10 19:40:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:45,091 INFO L93 Difference]: Finished difference Result 6004 states and 26765 transitions. [2020-02-10 19:40:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:45,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:45,105 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 19:40:45,106 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:40:45,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:40:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 19:40:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:40:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 19:40:45,318 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 19:40:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:45,318 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 19:40:45,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 19:40:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:45,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:45,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:45,325 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash -132377126, now seen corresponding path program 526 times [2020-02-10 19:40:45,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:45,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743035603] [2020-02-10 19:40:45,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:45,867 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:40:46,001 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40: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 19:40:46,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743035603] [2020-02-10 19:40:46,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:46,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:46,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062901726] [2020-02-10 19:40:46,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:46,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:46,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:46,010 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 19:40:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:46,337 INFO L93 Difference]: Finished difference Result 6010 states and 26771 transitions. [2020-02-10 19:40:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:46,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:46,352 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 19:40:46,352 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 19:40:46,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 19:40:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 19:40:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:40:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 19:40:46,560 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 19:40:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:46,560 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 19:40:46,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 19:40:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:46,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:46,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:46,565 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1131429032, now seen corresponding path program 527 times [2020-02-10 19:40:46,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:46,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540679982] [2020-02-10 19:40:46,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:47,103 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:47,234 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:47,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540679982] [2020-02-10 19:40:47,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:47,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:47,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033883659] [2020-02-10 19:40:47,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:47,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:47,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:47,245 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 19:40:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:47,606 INFO L93 Difference]: Finished difference Result 6007 states and 26766 transitions. [2020-02-10 19:40:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:47,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:47,622 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 19:40:47,622 INFO L226 Difference]: Without dead ends: 5990 [2020-02-10 19:40:47,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2020-02-10 19:40:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 3129. [2020-02-10 19:40:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:40:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15569 transitions. [2020-02-10 19:40:47,829 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15569 transitions. Word has length 31 [2020-02-10 19:40:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:47,830 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15569 transitions. [2020-02-10 19:40:47,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15569 transitions. [2020-02-10 19:40:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:47,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:47,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:47,835 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash -980999598, now seen corresponding path program 528 times [2020-02-10 19:40:47,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:47,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468665963] [2020-02-10 19:40:47,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:48,379 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:40:48,510 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:48,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468665963] [2020-02-10 19:40:48,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:48,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:48,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793424028] [2020-02-10 19:40:48,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:48,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:48,519 INFO L87 Difference]: Start difference. First operand 3129 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:40:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:48,730 INFO L93 Difference]: Finished difference Result 6012 states and 26769 transitions. [2020-02-10 19:40:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:48,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:48,745 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 19:40:48,745 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 19:40:48,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 19:40:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3110. [2020-02-10 19:40:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 19:40:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15528 transitions. [2020-02-10 19:40:48,958 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15528 transitions. Word has length 31 [2020-02-10 19:40:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:48,958 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15528 transitions. [2020-02-10 19:40:48,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15528 transitions. [2020-02-10 19:40:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:48,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:48,963 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:48,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1042117242, now seen corresponding path program 529 times [2020-02-10 19:40:48,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:48,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391453059] [2020-02-10 19:40:48,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:49,507 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:49,640 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:49,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 19:40:49,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391453059] [2020-02-10 19:40:49,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:49,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:49,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010485332] [2020-02-10 19:40:49,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:49,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:49,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:49,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:49,650 INFO L87 Difference]: Start difference. First operand 3110 states and 15528 transitions. Second operand 12 states. [2020-02-10 19:40:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:49,875 INFO L93 Difference]: Finished difference Result 6003 states and 26785 transitions. [2020-02-10 19:40:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:49,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:49,891 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 19:40:49,891 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 19:40:49,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 19:40:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3126. [2020-02-10 19:40:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:40:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-02-10 19:40:50,105 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-02-10 19:40:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:50,105 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-02-10 19:40:50,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-02-10 19:40:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:50,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:50,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:50,110 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1464602968, now seen corresponding path program 530 times [2020-02-10 19:40:50,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:50,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903115852] [2020-02-10 19:40:50,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:50,649 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:40:50,776 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:50,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903115852] [2020-02-10 19:40:50,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:50,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:50,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723682002] [2020-02-10 19:40:50,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:50,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:50,786 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-02-10 19:40:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:51,015 INFO L93 Difference]: Finished difference Result 6000 states and 26774 transitions. [2020-02-10 19:40:51,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:51,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:51,073 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 19:40:51,073 INFO L226 Difference]: Without dead ends: 5979 [2020-02-10 19:40:51,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-02-10 19:40:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3121. [2020-02-10 19:40:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:40:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 19:40:51,276 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 19:40:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:51,276 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 19:40:51,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 19:40:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:51,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:51,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:51,282 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1979916346, now seen corresponding path program 531 times [2020-02-10 19:40:51,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:51,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552822930] [2020-02-10 19:40:51,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:51,822 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:51,951 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:51,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552822930] [2020-02-10 19:40:51,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:51,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:51,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458771380] [2020-02-10 19:40:51,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:51,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:51,962 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:40:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:52,191 INFO L93 Difference]: Finished difference Result 6007 states and 26790 transitions. [2020-02-10 19:40:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:52,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:52,206 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 19:40:52,207 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:40:52,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:40:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 19:40:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:40:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 19:40:52,423 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 19:40:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:52,424 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 19:40:52,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 19:40:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:52,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:52,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:52,429 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -977483736, now seen corresponding path program 532 times [2020-02-10 19:40:52,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:52,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21780628] [2020-02-10 19:40:52,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:52,968 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:53,099 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40: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 19:40:53,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21780628] [2020-02-10 19:40:53,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:53,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:53,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396749603] [2020-02-10 19:40:53,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:53,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:53,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:53,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:53,109 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 19:40:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:53,333 INFO L93 Difference]: Finished difference Result 6006 states and 26781 transitions. [2020-02-10 19:40:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:53,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:53,347 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 19:40:53,347 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 19:40:53,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 19:40:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3121. [2020-02-10 19:40:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:40:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15565 transitions. [2020-02-10 19:40:53,559 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15565 transitions. Word has length 31 [2020-02-10 19:40:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:53,559 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15565 transitions. [2020-02-10 19:40:53,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15565 transitions. [2020-02-10 19:40:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:53,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:53,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:53,565 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1345275002, now seen corresponding path program 533 times [2020-02-10 19:40:53,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:53,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798081145] [2020-02-10 19:40:53,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:54,100 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:40:54,231 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:54,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798081145] [2020-02-10 19:40:54,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:54,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:54,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845367184] [2020-02-10 19:40:54,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:54,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:54,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:54,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:54,241 INFO L87 Difference]: Start difference. First operand 3121 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:40:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:54,510 INFO L93 Difference]: Finished difference Result 5999 states and 26767 transitions. [2020-02-10 19:40:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:54,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:54,525 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 19:40:54,525 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 19:40:54,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 19:40:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3126. [2020-02-10 19:40:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:40:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15574 transitions. [2020-02-10 19:40:54,739 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15574 transitions. Word has length 31 [2020-02-10 19:40:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:54,739 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15574 transitions. [2020-02-10 19:40:54,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15574 transitions. [2020-02-10 19:40:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:54,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:54,744 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:54,744 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1189639354, now seen corresponding path program 534 times [2020-02-10 19:40:54,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:54,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341975478] [2020-02-10 19:40:54,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:55,276 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:55,408 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:40:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:55,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341975478] [2020-02-10 19:40:55,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:55,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:55,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651489936] [2020-02-10 19:40:55,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:55,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:55,418 INFO L87 Difference]: Start difference. First operand 3126 states and 15574 transitions. Second operand 12 states. [2020-02-10 19:40:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:55,641 INFO L93 Difference]: Finished difference Result 6001 states and 26766 transitions. [2020-02-10 19:40:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:55,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:55,656 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 19:40:55,656 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 19:40:55,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 19:40:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3116. [2020-02-10 19:40:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:40:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-02-10 19:40:55,872 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-02-10 19:40:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:55,872 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-02-10 19:40:55,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-02-10 19:40:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:55,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:55,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:55,878 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 702246764, now seen corresponding path program 535 times [2020-02-10 19:40:55,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:55,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558665050] [2020-02-10 19:40:55,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:56,415 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:56,549 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:56,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558665050] [2020-02-10 19:40:56,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:56,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:56,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681899854] [2020-02-10 19:40:56,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:56,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:56,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:56,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:56,559 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-02-10 19:40:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:56,821 INFO L93 Difference]: Finished difference Result 6011 states and 26797 transitions. [2020-02-10 19:40:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:56,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:56,837 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 19:40:56,837 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:40:56,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:40:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-02-10 19:40:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:40:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-02-10 19:40:57,051 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-02-10 19:40:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:57,051 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-02-10 19:40:57,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-02-10 19:40:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:57,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:57,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:57,056 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 279761038, now seen corresponding path program 536 times [2020-02-10 19:40:57,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:57,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639962825] [2020-02-10 19:40:57,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:57,586 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:40:57,710 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:57,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639962825] [2020-02-10 19:40:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:57,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:57,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660477183] [2020-02-10 19:40:57,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:57,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:57,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:57,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:57,721 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:40:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:57,953 INFO L93 Difference]: Finished difference Result 6008 states and 26786 transitions. [2020-02-10 19:40:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:57,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:57,968 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 19:40:57,969 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 19:40:57,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 19:40:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-02-10 19:40:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:40:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 19:40:58,186 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 19:40:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:58,186 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 19:40:58,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 19:40:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:58,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:58,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:58,192 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1207153798, now seen corresponding path program 537 times [2020-02-10 19:40:58,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:58,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139118997] [2020-02-10 19:40:58,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:40:58,732 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:40:58,863 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:40:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:40:58,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139118997] [2020-02-10 19:40:58,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:40:58,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:40:58,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326646056] [2020-02-10 19:40:58,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:40:58,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:40:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:40:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:40:58,873 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:40:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:40:59,181 INFO L93 Difference]: Finished difference Result 6021 states and 26814 transitions. [2020-02-10 19:40:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:40:59,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:40:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:40:59,196 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 19:40:59,197 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 19:40:59,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:40:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 19:40:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3131. [2020-02-10 19:40:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:40:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15585 transitions. [2020-02-10 19:40:59,458 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15585 transitions. Word has length 31 [2020-02-10 19:40:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:40:59,459 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15585 transitions. [2020-02-10 19:40:59,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:40:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15585 transitions. [2020-02-10 19:40:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:40:59,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:40:59,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:40:59,464 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:40:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:40:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1137043762, now seen corresponding path program 538 times [2020-02-10 19:40:59,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:40:59,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183507702] [2020-02-10 19:40:59,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:40:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:00,013 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:41:00,146 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:00,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183507702] [2020-02-10 19:41:00,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:00,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:00,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759313803] [2020-02-10 19:41:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:00,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:00,157 INFO L87 Difference]: Start difference. First operand 3131 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:41:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:00,346 INFO L93 Difference]: Finished difference Result 6024 states and 26811 transitions. [2020-02-10 19:41:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:00,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:00,361 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 19:41:00,361 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 19:41:00,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 19:41:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3122. [2020-02-10 19:41:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:41:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-02-10 19:41:00,577 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-02-10 19:41:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:00,577 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-02-10 19:41:00,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-02-10 19:41:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:00,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:00,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:00,583 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1841795142, now seen corresponding path program 539 times [2020-02-10 19:41:00,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:00,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183717958] [2020-02-10 19:41:00,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:01,113 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 19:41:01,244 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:01,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183717958] [2020-02-10 19:41:01,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:01,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:01,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044914394] [2020-02-10 19:41:01,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:01,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:01,254 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-02-10 19:41:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:01,516 INFO L93 Difference]: Finished difference Result 6012 states and 26787 transitions. [2020-02-10 19:41:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:01,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:01,531 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 19:41:01,531 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 19:41:01,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 19:41:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-02-10 19:41:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:41:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 19:41:01,738 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 19:41:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:01,738 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 19:41:01,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 19:41:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:01,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:01,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:01,743 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1349199380, now seen corresponding path program 540 times [2020-02-10 19:41:01,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:01,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762711357] [2020-02-10 19:41:01,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:02,283 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:41:02,412 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:02,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762711357] [2020-02-10 19:41:02,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:02,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:02,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042039848] [2020-02-10 19:41:02,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:02,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:02,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:02,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:02,423 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 19:41:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:02,612 INFO L93 Difference]: Finished difference Result 6018 states and 26793 transitions. [2020-02-10 19:41:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:02,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:02,627 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 19:41:02,627 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 19:41:02,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 19:41:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-02-10 19:41:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:41:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-02-10 19:41:02,842 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-02-10 19:41:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:02,843 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-02-10 19:41:02,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-02-10 19:41:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:02,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:02,848 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1376926228, now seen corresponding path program 541 times [2020-02-10 19:41:02,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:02,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508079820] [2020-02-10 19:41:02,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:03,395 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:03,523 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:03,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508079820] [2020-02-10 19:41:03,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:03,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:03,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730166708] [2020-02-10 19:41:03,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:03,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:03,533 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-02-10 19:41:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:03,773 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-02-10 19:41:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:03,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:03,789 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 19:41:03,789 INFO L226 Difference]: Without dead ends: 6004 [2020-02-10 19:41:03,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-02-10 19:41:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3131. [2020-02-10 19:41:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:41:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15588 transitions. [2020-02-10 19:41:03,997 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15588 transitions. Word has length 31 [2020-02-10 19:41:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:03,997 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15588 transitions. [2020-02-10 19:41:03,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15588 transitions. [2020-02-10 19:41:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:04,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:04,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:04,002 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:04,003 INFO L82 PathProgramCache]: Analyzing trace with hash -39359014, now seen corresponding path program 542 times [2020-02-10 19:41:04,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:04,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750891407] [2020-02-10 19:41:04,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:04,549 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:04,679 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:04,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750891407] [2020-02-10 19:41:04,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:04,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:04,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516708595] [2020-02-10 19:41:04,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:04,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:04,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:04,690 INFO L87 Difference]: Start difference. First operand 3131 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:41:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:04,951 INFO L93 Difference]: Finished difference Result 6022 states and 26816 transitions. [2020-02-10 19:41:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:04,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:04,966 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 19:41:04,966 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 19:41:04,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 19:41:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-02-10 19:41:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:41:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15568 transitions. [2020-02-10 19:41:05,175 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15568 transitions. Word has length 31 [2020-02-10 19:41:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:05,175 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15568 transitions. [2020-02-10 19:41:05,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15568 transitions. [2020-02-10 19:41:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:05,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:05,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:05,181 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393082, now seen corresponding path program 543 times [2020-02-10 19:41:05,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:05,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350204660] [2020-02-10 19:41:05,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:05,721 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:05,856 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41: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 19:41:05,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350204660] [2020-02-10 19:41:05,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:05,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:05,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400495310] [2020-02-10 19:41:05,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:05,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:05,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:05,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:05,867 INFO L87 Difference]: Start difference. First operand 3124 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:41:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:06,092 INFO L93 Difference]: Finished difference Result 6029 states and 26830 transitions. [2020-02-10 19:41:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:06,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:06,107 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 19:41:06,107 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 19:41:06,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 19:41:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3133. [2020-02-10 19:41:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:41:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-02-10 19:41:06,326 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-02-10 19:41:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:06,326 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-02-10 19:41:06,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-02-10 19:41:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:06,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:06,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:06,331 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1943283046, now seen corresponding path program 544 times [2020-02-10 19:41:06,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:06,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048038746] [2020-02-10 19:41:06,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:06,888 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:41:07,020 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:07,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048038746] [2020-02-10 19:41:07,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:07,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:07,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111635137] [2020-02-10 19:41:07,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:07,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:07,030 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:41:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:07,331 INFO L93 Difference]: Finished difference Result 6032 states and 26827 transitions. [2020-02-10 19:41:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:07,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:07,347 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 19:41:07,347 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:41:07,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:41:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 19:41:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:41:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15560 transitions. [2020-02-10 19:41:07,566 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15560 transitions. Word has length 31 [2020-02-10 19:41:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:07,566 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15560 transitions. [2020-02-10 19:41:07,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15560 transitions. [2020-02-10 19:41:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:07,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:07,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:07,571 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:07,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2134052102, now seen corresponding path program 545 times [2020-02-10 19:41:07,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:07,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276008220] [2020-02-10 19:41:07,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:08,319 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:08,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276008220] [2020-02-10 19:41:08,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:08,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:08,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223712903] [2020-02-10 19:41:08,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:08,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:08,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:08,329 INFO L87 Difference]: Start difference. First operand 3124 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:41:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:08,585 INFO L93 Difference]: Finished difference Result 6026 states and 26815 transitions. [2020-02-10 19:41:08,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:08,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:08,599 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 19:41:08,599 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 19:41:08,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 19:41:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3132. [2020-02-10 19:41:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:41:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15575 transitions. [2020-02-10 19:41:08,807 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15575 transitions. Word has length 31 [2020-02-10 19:41:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:08,808 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15575 transitions. [2020-02-10 19:41:08,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15575 transitions. [2020-02-10 19:41:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:08,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:08,813 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash 866594924, now seen corresponding path program 546 times [2020-02-10 19:41:08,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:08,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301317787] [2020-02-10 19:41:08,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:09,353 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:41:09,482 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:09,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301317787] [2020-02-10 19:41:09,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:09,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:09,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387006266] [2020-02-10 19:41:09,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:09,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:09,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:09,492 INFO L87 Difference]: Start difference. First operand 3132 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:41:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:09,689 INFO L93 Difference]: Finished difference Result 6030 states and 26815 transitions. [2020-02-10 19:41:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:09,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:09,704 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 19:41:09,704 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:41:09,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:41:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3116. [2020-02-10 19:41:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:41:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-02-10 19:41:09,912 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-02-10 19:41:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:09,912 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-02-10 19:41:09,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-02-10 19:41:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:09,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:09,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:09,918 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1542862, now seen corresponding path program 547 times [2020-02-10 19:41:09,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:09,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030501431] [2020-02-10 19:41:09,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:10,441 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:10,575 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:10,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030501431] [2020-02-10 19:41:10,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:10,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:10,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892369548] [2020-02-10 19:41:10,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:10,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:10,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:10,586 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-02-10 19:41:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:10,830 INFO L93 Difference]: Finished difference Result 6005 states and 26772 transitions. [2020-02-10 19:41:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:10,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:10,845 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 19:41:10,845 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 19:41:10,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 19:41:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-02-10 19:41:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:41:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-02-10 19:41:11,062 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-02-10 19:41:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:11,062 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-02-10 19:41:11,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-02-10 19:41:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:11,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:11,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:11,067 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1761595802, now seen corresponding path program 548 times [2020-02-10 19:41:11,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:11,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992280842] [2020-02-10 19:41:11,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:11,594 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:11,723 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:11,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992280842] [2020-02-10 19:41:11,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:11,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:11,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501001670] [2020-02-10 19:41:11,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:11,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:11,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:11,733 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:41:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:11,966 INFO L93 Difference]: Finished difference Result 6007 states and 26771 transitions. [2020-02-10 19:41:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:11,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:11,982 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 19:41:11,982 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 19:41:11,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 19:41:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-02-10 19:41:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:41:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 19:41:12,196 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 19:41:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:12,197 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 19:41:12,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 19:41:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:12,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:12,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:12,202 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -634923992, now seen corresponding path program 549 times [2020-02-10 19:41:12,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:12,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341456056] [2020-02-10 19:41:12,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:12,716 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:12,849 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:12,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341456056] [2020-02-10 19:41:12,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:12,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:12,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412005866] [2020-02-10 19:41:12,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:12,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:12,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:12,859 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 19:41:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:13,105 INFO L93 Difference]: Finished difference Result 6010 states and 26776 transitions. [2020-02-10 19:41:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:13,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:13,121 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 19:41:13,121 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 19:41:13,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 19:41:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-02-10 19:41:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:41:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-02-10 19:41:13,329 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-02-10 19:41:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:13,329 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-02-10 19:41:13,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-02-10 19:41:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:13,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:13,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:13,334 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash -142328230, now seen corresponding path program 550 times [2020-02-10 19:41:13,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:13,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315509898] [2020-02-10 19:41:13,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:13,865 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:41:13,995 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:14,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315509898] [2020-02-10 19:41:14,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:14,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:14,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814137137] [2020-02-10 19:41:14,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:14,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:14,005 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-02-10 19:41:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:14,199 INFO L93 Difference]: Finished difference Result 6016 states and 26782 transitions. [2020-02-10 19:41:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:14,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:14,214 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 19:41:14,215 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:41:14,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:41:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3122. [2020-02-10 19:41:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:41:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 19:41:14,425 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 19:41:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:14,425 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 19:41:14,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 19:41:14,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:14,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:14,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:14,430 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash -147804760, now seen corresponding path program 551 times [2020-02-10 19:41:14,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:14,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521856002] [2020-02-10 19:41:14,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:14,961 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:15,095 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:15,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521856002] [2020-02-10 19:41:15,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:15,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:15,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204983908] [2020-02-10 19:41:15,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:15,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:15,104 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 19:41:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:15,377 INFO L93 Difference]: Finished difference Result 6016 states and 26784 transitions. [2020-02-10 19:41:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:15,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:15,392 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 19:41:15,392 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:41:15,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:41:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-02-10 19:41:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:41:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15565 transitions. [2020-02-10 19:41:15,600 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15565 transitions. Word has length 31 [2020-02-10 19:41:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:15,601 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15565 transitions. [2020-02-10 19:41:15,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15565 transitions. [2020-02-10 19:41:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:15,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:15,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:15,606 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1415261938, now seen corresponding path program 552 times [2020-02-10 19:41:15,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:15,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729871619] [2020-02-10 19:41:15,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:16,144 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:41:16,273 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:16,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729871619] [2020-02-10 19:41:16,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:16,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:16,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971816349] [2020-02-10 19:41:16,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:16,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:16,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:16,282 INFO L87 Difference]: Start difference. First operand 3130 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:41:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:16,508 INFO L93 Difference]: Finished difference Result 6020 states and 26784 transitions. [2020-02-10 19:41:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:16,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:16,523 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 19:41:16,523 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 19:41:16,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 19:41:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3110. [2020-02-10 19:41:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 19:41:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15522 transitions. [2020-02-10 19:41:16,741 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15522 transitions. Word has length 31 [2020-02-10 19:41:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:16,741 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15522 transitions. [2020-02-10 19:41:16,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15522 transitions. [2020-02-10 19:41:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:16,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:16,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:16,746 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:16,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1910641922, now seen corresponding path program 553 times [2020-02-10 19:41:16,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:16,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105030703] [2020-02-10 19:41:16,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:17,287 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:41:17,417 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:17,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105030703] [2020-02-10 19:41:17,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:17,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:17,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740158384] [2020-02-10 19:41:17,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:17,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:17,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:17,428 INFO L87 Difference]: Start difference. First operand 3110 states and 15522 transitions. Second operand 12 states. [2020-02-10 19:41:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:17,699 INFO L93 Difference]: Finished difference Result 6017 states and 26824 transitions. [2020-02-10 19:41:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:17,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:17,714 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 19:41:17,714 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 19:41:17,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 19:41:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 19:41:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:41:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15589 transitions. [2020-02-10 19:41:17,922 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15589 transitions. Word has length 31 [2020-02-10 19:41:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:17,922 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15589 transitions. [2020-02-10 19:41:17,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15589 transitions. [2020-02-10 19:41:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:17,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:17,928 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:17,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash 271896744, now seen corresponding path program 554 times [2020-02-10 19:41:17,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:17,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208524942] [2020-02-10 19:41:17,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:18,457 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:18,582 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:18,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 19:41:18,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208524942] [2020-02-10 19:41:18,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:18,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:18,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938873665] [2020-02-10 19:41:18,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:18,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:18,592 INFO L87 Difference]: Start difference. First operand 3129 states and 15589 transitions. Second operand 12 states. [2020-02-10 19:41:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:18,857 INFO L93 Difference]: Finished difference Result 6015 states and 26814 transitions. [2020-02-10 19:41:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:18,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:18,872 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 19:41:18,872 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:41:18,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:41:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 19:41:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:41:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15572 transitions. [2020-02-10 19:41:19,091 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15572 transitions. Word has length 31 [2020-02-10 19:41:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:19,091 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15572 transitions. [2020-02-10 19:41:19,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15572 transitions. [2020-02-10 19:41:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:19,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:19,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:19,097 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1960014138, now seen corresponding path program 555 times [2020-02-10 19:41:19,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:19,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363803667] [2020-02-10 19:41:19,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:19,649 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:41:19,778 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:41:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:19,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363803667] [2020-02-10 19:41:19,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:19,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:19,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940433859] [2020-02-10 19:41:19,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:19,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:19,788 INFO L87 Difference]: Start difference. First operand 3123 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:41:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:20,071 INFO L93 Difference]: Finished difference Result 6019 states and 26823 transitions. [2020-02-10 19:41:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:20,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:20,086 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 19:41:20,087 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 19:41:20,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 19:41:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3130. [2020-02-10 19:41:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:41:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15585 transitions. [2020-02-10 19:41:20,292 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15585 transitions. Word has length 31 [2020-02-10 19:41:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:20,293 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15585 transitions. [2020-02-10 19:41:20,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15585 transitions. [2020-02-10 19:41:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:20,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:20,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:20,298 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -997385944, now seen corresponding path program 556 times [2020-02-10 19:41:20,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:20,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085271949] [2020-02-10 19:41:20,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:20,843 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:20,975 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:20,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085271949] [2020-02-10 19:41:20,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:20,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:20,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147732475] [2020-02-10 19:41:20,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:20,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:20,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:20,986 INFO L87 Difference]: Start difference. First operand 3130 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:41:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:21,225 INFO L93 Difference]: Finished difference Result 6018 states and 26814 transitions. [2020-02-10 19:41:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:21,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:21,240 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 19:41:21,240 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 19:41:21,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 19:41:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-02-10 19:41:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:41:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15566 transitions. [2020-02-10 19:41:21,449 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15566 transitions. Word has length 31 [2020-02-10 19:41:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:21,449 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15566 transitions. [2020-02-10 19:41:21,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15566 transitions. [2020-02-10 19:41:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:21,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:21,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:21,454 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1213192582, now seen corresponding path program 557 times [2020-02-10 19:41:21,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:21,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350197199] [2020-02-10 19:41:21,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:22,003 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:22,133 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:22,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350197199] [2020-02-10 19:41:22,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:22,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:22,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837041748] [2020-02-10 19:41:22,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:22,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:22,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:22,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:22,143 INFO L87 Difference]: Start difference. First operand 3123 states and 15566 transitions. Second operand 12 states. [2020-02-10 19:41:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:22,398 INFO L93 Difference]: Finished difference Result 6014 states and 26806 transitions. [2020-02-10 19:41:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:22,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:22,412 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 19:41:22,413 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 19:41:22,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 19:41:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3129. [2020-02-10 19:41:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:41:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15577 transitions. [2020-02-10 19:41:22,619 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15577 transitions. Word has length 31 [2020-02-10 19:41:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:22,620 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15577 transitions. [2020-02-10 19:41:22,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15577 transitions. [2020-02-10 19:41:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:22,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:22,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:22,625 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2058164034, now seen corresponding path program 558 times [2020-02-10 19:41:22,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:22,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192179289] [2020-02-10 19:41:22,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:23,165 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:23,298 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:23,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192179289] [2020-02-10 19:41:23,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:23,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:23,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953427406] [2020-02-10 19:41:23,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:23,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:23,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:23,308 INFO L87 Difference]: Start difference. First operand 3129 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:41:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:23,560 INFO L93 Difference]: Finished difference Result 6015 states and 26802 transitions. [2020-02-10 19:41:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:23,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:23,576 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 19:41:23,576 INFO L226 Difference]: Without dead ends: 5985 [2020-02-10 19:41:23,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-02-10 19:41:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3117. [2020-02-10 19:41:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 19:41:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15549 transitions. [2020-02-10 19:41:23,790 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15549 transitions. Word has length 31 [2020-02-10 19:41:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:23,790 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15549 transitions. [2020-02-10 19:41:23,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15549 transitions. [2020-02-10 19:41:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:23,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:23,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:23,796 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash -166277916, now seen corresponding path program 559 times [2020-02-10 19:41:23,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:23,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695254855] [2020-02-10 19:41:23,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:24,349 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:41:24,481 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:24,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695254855] [2020-02-10 19:41:24,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:24,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:24,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630221225] [2020-02-10 19:41:24,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:24,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:24,491 INFO L87 Difference]: Start difference. First operand 3117 states and 15549 transitions. Second operand 12 states. [2020-02-10 19:41:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:24,786 INFO L93 Difference]: Finished difference Result 6025 states and 26835 transitions. [2020-02-10 19:41:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:24,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:24,802 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 19:41:24,802 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 19:41:24,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 19:41:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 19:41:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:41:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-02-10 19:41:25,053 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-02-10 19:41:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:25,054 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-02-10 19:41:25,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-02-10 19:41:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:25,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:25,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:25,059 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:25,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:25,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2016260750, now seen corresponding path program 560 times [2020-02-10 19:41:25,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:25,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146359055] [2020-02-10 19:41:25,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:25,602 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:25,734 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:25,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146359055] [2020-02-10 19:41:25,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:25,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:25,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97775973] [2020-02-10 19:41:25,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:25,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:25,744 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:41:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:26,010 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-02-10 19:41:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:26,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:26,025 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 19:41:26,025 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 19:41:26,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 19:41:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-02-10 19:41:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:41:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 19:41:26,234 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 19:41:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:26,234 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 19:41:26,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 19:41:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:26,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:26,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:26,239 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1227056006, now seen corresponding path program 561 times [2020-02-10 19:41:26,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:26,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769488927] [2020-02-10 19:41:26,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:26,790 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:41:26,922 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:26,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769488927] [2020-02-10 19:41:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:26,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:26,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899998279] [2020-02-10 19:41:26,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:26,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:26,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:26,932 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 19:41:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:27,169 INFO L93 Difference]: Finished difference Result 6033 states and 26846 transitions. [2020-02-10 19:41:27,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:27,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:27,184 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 19:41:27,185 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 19:41:27,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 19:41:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3133. [2020-02-10 19:41:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:41:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15586 transitions. [2020-02-10 19:41:27,398 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15586 transitions. Word has length 31 [2020-02-10 19:41:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:27,398 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15586 transitions. [2020-02-10 19:41:27,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15586 transitions. [2020-02-10 19:41:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:27,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:27,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:27,403 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1156945970, now seen corresponding path program 562 times [2020-02-10 19:41:27,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:27,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458634416] [2020-02-10 19:41:27,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:27,954 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:41:28,085 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:28,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 19:41:28,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458634416] [2020-02-10 19:41:28,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:28,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:28,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541968461] [2020-02-10 19:41:28,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:28,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:28,095 INFO L87 Difference]: Start difference. First operand 3133 states and 15586 transitions. Second operand 12 states. [2020-02-10 19:41:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:28,338 INFO L93 Difference]: Finished difference Result 6036 states and 26843 transitions. [2020-02-10 19:41:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:28,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:28,352 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 19:41:28,353 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 19:41:28,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 19:41:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3124. [2020-02-10 19:41:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:41:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15562 transitions. [2020-02-10 19:41:28,567 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15562 transitions. Word has length 31 [2020-02-10 19:41:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:28,567 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15562 transitions. [2020-02-10 19:41:28,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15562 transitions. [2020-02-10 19:41:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:28,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:28,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:28,572 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:28,573 INFO L82 PathProgramCache]: Analyzing trace with hash -105295430, now seen corresponding path program 563 times [2020-02-10 19:41:28,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:28,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25050072] [2020-02-10 19:41:28,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:29,121 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:29,253 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:29,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 19:41:29,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25050072] [2020-02-10 19:41:29,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:29,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:29,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518264031] [2020-02-10 19:41:29,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:29,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:29,264 INFO L87 Difference]: Start difference. First operand 3124 states and 15562 transitions. Second operand 12 states. [2020-02-10 19:41:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:29,522 INFO L93 Difference]: Finished difference Result 6027 states and 26825 transitions. [2020-02-10 19:41:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:29,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:29,538 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 19:41:29,538 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 19:41:29,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 19:41:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3131. [2020-02-10 19:41:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:41:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15575 transitions. [2020-02-10 19:41:29,752 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15575 transitions. Word has length 31 [2020-02-10 19:41:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:29,752 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15575 transitions. [2020-02-10 19:41:29,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15575 transitions. [2020-02-10 19:41:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:29,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:29,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:29,758 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:29,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2077243236, now seen corresponding path program 564 times [2020-02-10 19:41:29,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:29,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548183644] [2020-02-10 19:41:29,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:30,308 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:41:30,437 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:41:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:30,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548183644] [2020-02-10 19:41:30,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:30,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:30,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685373119] [2020-02-10 19:41:30,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:30,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:30,446 INFO L87 Difference]: Start difference. First operand 3131 states and 15575 transitions. Second operand 12 states. [2020-02-10 19:41:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:30,670 INFO L93 Difference]: Finished difference Result 6032 states and 26828 transitions. [2020-02-10 19:41:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:30,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:30,685 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 19:41:30,685 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 19:41:30,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 19:41:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3117. [2020-02-10 19:41:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 19:41:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15542 transitions. [2020-02-10 19:41:30,893 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15542 transitions. Word has length 31 [2020-02-10 19:41:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:30,893 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15542 transitions. [2020-02-10 19:41:30,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15542 transitions. [2020-02-10 19:41:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:30,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:30,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:30,898 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -859335580, now seen corresponding path program 565 times [2020-02-10 19:41:30,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:30,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815674700] [2020-02-10 19:41:30,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:31,448 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:41:31,580 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:41:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:31,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815674700] [2020-02-10 19:41:31,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:31,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:31,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514155312] [2020-02-10 19:41:31,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:31,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:31,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:31,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:31,591 INFO L87 Difference]: Start difference. First operand 3117 states and 15542 transitions. Second operand 12 states. [2020-02-10 19:41:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:31,951 INFO L93 Difference]: Finished difference Result 6031 states and 26845 transitions. [2020-02-10 19:41:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:31,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:31,966 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 19:41:31,966 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 19:41:31,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 19:41:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3132. [2020-02-10 19:41:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:41:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15585 transitions. [2020-02-10 19:41:32,173 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15585 transitions. Word has length 31 [2020-02-10 19:41:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:32,174 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15585 transitions. [2020-02-10 19:41:32,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15585 transitions. [2020-02-10 19:41:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:32,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:32,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:32,179 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:32,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash 478231634, now seen corresponding path program 566 times [2020-02-10 19:41:32,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:32,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969530594] [2020-02-10 19:41:32,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:32,720 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:32,857 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:32,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969530594] [2020-02-10 19:41:32,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:32,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:32,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264484167] [2020-02-10 19:41:32,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:32,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:32,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:32,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:32,868 INFO L87 Difference]: Start difference. First operand 3132 states and 15585 transitions. Second operand 12 states. [2020-02-10 19:41:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:33,119 INFO L93 Difference]: Finished difference Result 6030 states and 26836 transitions. [2020-02-10 19:41:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:33,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:33,134 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 19:41:33,134 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 19:41:33,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 19:41:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3125. [2020-02-10 19:41:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:41:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15565 transitions. [2020-02-10 19:41:33,402 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15565 transitions. Word has length 31 [2020-02-10 19:41:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:33,402 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15565 transitions. [2020-02-10 19:41:33,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15565 transitions. [2020-02-10 19:41:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:33,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:33,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:33,408 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1495802434, now seen corresponding path program 567 times [2020-02-10 19:41:33,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:33,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151736888] [2020-02-10 19:41:33,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:33,947 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:41:34,077 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:41:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:34,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151736888] [2020-02-10 19:41:34,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:34,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:34,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606666567] [2020-02-10 19:41:34,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:34,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:34,087 INFO L87 Difference]: Start difference. First operand 3125 states and 15565 transitions. Second operand 12 states. [2020-02-10 19:41:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:34,452 INFO L93 Difference]: Finished difference Result 6037 states and 26850 transitions. [2020-02-10 19:41:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:34,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:34,467 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 19:41:34,467 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 19:41:34,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 19:41:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3134. [2020-02-10 19:41:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:41:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15582 transitions. [2020-02-10 19:41:34,683 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15582 transitions. Word has length 31 [2020-02-10 19:41:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:34,683 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15582 transitions. [2020-02-10 19:41:34,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15582 transitions. [2020-02-10 19:41:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:34,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:34,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:34,689 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:34,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:34,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1425692398, now seen corresponding path program 568 times [2020-02-10 19:41:34,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:34,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928155777] [2020-02-10 19:41:34,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:35,249 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 19:41:35,381 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:41:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:35,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928155777] [2020-02-10 19:41:35,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:35,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:35,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506105351] [2020-02-10 19:41:35,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:35,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:35,391 INFO L87 Difference]: Start difference. First operand 3134 states and 15582 transitions. Second operand 12 states. [2020-02-10 19:41:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:35,716 INFO L93 Difference]: Finished difference Result 6040 states and 26847 transitions. [2020-02-10 19:41:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:35,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:35,730 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 19:41:35,730 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 19:41:35,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 19:41:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3125. [2020-02-10 19:41:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 19:41:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-02-10 19:41:35,945 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-02-10 19:41:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:35,946 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-02-10 19:41:35,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-02-10 19:41:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:35,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:35,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:35,951 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1643324546, now seen corresponding path program 569 times [2020-02-10 19:41:35,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:35,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531426342] [2020-02-10 19:41:35,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:36,490 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:36,621 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:36,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531426342] [2020-02-10 19:41:36,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:36,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:36,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314805237] [2020-02-10 19:41:36,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:36,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:36,630 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-02-10 19:41:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:36,987 INFO L93 Difference]: Finished difference Result 6034 states and 26835 transitions. [2020-02-10 19:41:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:36,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:37,003 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 19:41:37,003 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:41:37,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:41:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-02-10 19:41:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:41:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15572 transitions. [2020-02-10 19:41:37,220 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15572 transitions. Word has length 31 [2020-02-10 19:41:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:37,220 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15572 transitions. [2020-02-10 19:41:37,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15572 transitions. [2020-02-10 19:41:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:37,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:37,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:37,226 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1384185572, now seen corresponding path program 570 times [2020-02-10 19:41:37,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:37,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847414208] [2020-02-10 19:41:37,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:37,771 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:41:37,902 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:37,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847414208] [2020-02-10 19:41:37,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:37,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:37,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086617024] [2020-02-10 19:41:37,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:37,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:37,911 INFO L87 Difference]: Start difference. First operand 3133 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:41:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:38,138 INFO L93 Difference]: Finished difference Result 6038 states and 26835 transitions. [2020-02-10 19:41:38,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:38,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:38,152 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 19:41:38,152 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 19:41:38,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 19:41:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3117. [2020-02-10 19:41:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 19:41:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15535 transitions. [2020-02-10 19:41:38,369 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15535 transitions. Word has length 31 [2020-02-10 19:41:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:38,369 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15535 transitions. [2020-02-10 19:41:38,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15535 transitions. [2020-02-10 19:41:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:38,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:38,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:38,375 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:38,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:38,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1738042574, now seen corresponding path program 571 times [2020-02-10 19:41:38,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:38,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183402030] [2020-02-10 19:41:38,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:39,048 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:39,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183402030] [2020-02-10 19:41:39,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:39,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:39,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134648261] [2020-02-10 19:41:39,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:39,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:39,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:39,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:39,058 INFO L87 Difference]: Start difference. First operand 3117 states and 15535 transitions. Second operand 12 states. [2020-02-10 19:41:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:39,318 INFO L93 Difference]: Finished difference Result 6020 states and 26810 transitions. [2020-02-10 19:41:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:39,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:39,332 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 19:41:39,333 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 19:41:39,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 19:41:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3130. [2020-02-10 19:41:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:41:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15572 transitions. [2020-02-10 19:41:39,539 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15572 transitions. Word has length 31 [2020-02-10 19:41:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:39,539 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15572 transitions. [2020-02-10 19:41:39,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15572 transitions. [2020-02-10 19:41:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:39,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:39,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:39,545 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 893071122, now seen corresponding path program 572 times [2020-02-10 19:41:39,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:39,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518512876] [2020-02-10 19:41:39,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:40,085 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:40,218 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:40,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518512876] [2020-02-10 19:41:40,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:40,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:40,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979422355] [2020-02-10 19:41:40,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:40,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:40,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:40,228 INFO L87 Difference]: Start difference. First operand 3130 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:41:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:40,451 INFO L93 Difference]: Finished difference Result 6021 states and 26806 transitions. [2020-02-10 19:41:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:40,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:40,467 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 19:41:40,468 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 19:41:40,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 19:41:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-02-10 19:41:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:41:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15555 transitions. [2020-02-10 19:41:40,680 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15555 transitions. Word has length 31 [2020-02-10 19:41:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:40,680 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15555 transitions. [2020-02-10 19:41:40,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15555 transitions. [2020-02-10 19:41:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:40,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:40,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:40,686 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1101575720, now seen corresponding path program 573 times [2020-02-10 19:41:40,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:40,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232847784] [2020-02-10 19:41:40,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:41,221 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:41,346 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:41,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232847784] [2020-02-10 19:41:41,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:41,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:41,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432534561] [2020-02-10 19:41:41,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:41,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:41,356 INFO L87 Difference]: Start difference. First operand 3124 states and 15555 transitions. Second operand 12 states. [2020-02-10 19:41:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:41,601 INFO L93 Difference]: Finished difference Result 6025 states and 26813 transitions. [2020-02-10 19:41:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:41,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:41,616 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 19:41:41,616 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 19:41:41,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 19:41:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-02-10 19:41:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:41:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15568 transitions. [2020-02-10 19:41:41,829 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15568 transitions. Word has length 31 [2020-02-10 19:41:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:41,829 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15568 transitions. [2020-02-10 19:41:41,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15568 transitions. [2020-02-10 19:41:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:41,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:41,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:41,834 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1010852910, now seen corresponding path program 574 times [2020-02-10 19:41:41,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:41,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368437120] [2020-02-10 19:41:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:42,421 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:41:42,551 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:42,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368437120] [2020-02-10 19:41:42,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:42,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:42,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852939884] [2020-02-10 19:41:42,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:42,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:42,561 INFO L87 Difference]: Start difference. First operand 3131 states and 15568 transitions. Second operand 12 states. [2020-02-10 19:41:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:42,736 INFO L93 Difference]: Finished difference Result 6030 states and 26816 transitions. [2020-02-10 19:41:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:42,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:42,752 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 19:41:42,752 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 19:41:42,752 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 19:41:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 19:41:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:41:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15548 transitions. [2020-02-10 19:41:42,961 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15548 transitions. Word has length 31 [2020-02-10 19:41:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:42,961 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15548 transitions. [2020-02-10 19:41:42,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15548 transitions. [2020-02-10 19:41:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:42,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:42,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:42,966 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash -167706968, now seen corresponding path program 575 times [2020-02-10 19:41:42,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:42,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888729506] [2020-02-10 19:41:42,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:43,637 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:43,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 19:41:43,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888729506] [2020-02-10 19:41:43,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:43,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:43,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873358729] [2020-02-10 19:41:43,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:43,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:43,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:43,646 INFO L87 Difference]: Start difference. First operand 3124 states and 15548 transitions. Second operand 12 states. [2020-02-10 19:41:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:43,884 INFO L93 Difference]: Finished difference Result 6028 states and 26813 transitions. [2020-02-10 19:41:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:43,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:43,899 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 19:41:43,899 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 19:41:43,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 19:41:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3132. [2020-02-10 19:41:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:41:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15563 transitions. [2020-02-10 19:41:44,105 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15563 transitions. Word has length 31 [2020-02-10 19:41:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:44,106 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15563 transitions. [2020-02-10 19:41:44,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15563 transitions. [2020-02-10 19:41:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:44,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:44,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:44,111 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1435164146, now seen corresponding path program 576 times [2020-02-10 19:41:44,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:44,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074428653] [2020-02-10 19:41:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:44,664 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:41:44,797 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:44,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 19:41:44,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074428653] [2020-02-10 19:41:44,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:44,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:44,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323797369] [2020-02-10 19:41:44,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:44,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:44,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:44,807 INFO L87 Difference]: Start difference. First operand 3132 states and 15563 transitions. Second operand 12 states. [2020-02-10 19:41:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:45,018 INFO L93 Difference]: Finished difference Result 6032 states and 26813 transitions. [2020-02-10 19:41:45,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:45,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:45,033 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 19:41:45,033 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:41:45,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:41:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3110. [2020-02-10 19:41:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 19:41:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15516 transitions. [2020-02-10 19:41:45,242 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15516 transitions. Word has length 31 [2020-02-10 19:41:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:45,242 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15516 transitions. [2020-02-10 19:41:45,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15516 transitions. [2020-02-10 19:41:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:45,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:45,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:45,247 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1744708478, now seen corresponding path program 577 times [2020-02-10 19:41:45,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:45,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873203269] [2020-02-10 19:41:45,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:45,785 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:45,919 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:41:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:45,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873203269] [2020-02-10 19:41:45,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:45,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:45,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222050857] [2020-02-10 19:41:45,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:45,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:45,930 INFO L87 Difference]: Start difference. First operand 3110 states and 15516 transitions. Second operand 12 states. [2020-02-10 19:41:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:46,149 INFO L93 Difference]: Finished difference Result 5989 states and 26739 transitions. [2020-02-10 19:41:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:46,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:46,164 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 19:41:46,164 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 19:41:46,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 19:41:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3126. [2020-02-10 19:41:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:41:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 19:41:46,371 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 19:41:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:46,372 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 19:41:46,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 19:41:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:46,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:46,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:46,377 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 54765574, now seen corresponding path program 578 times [2020-02-10 19:41:46,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:46,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356467911] [2020-02-10 19:41:46,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:46,924 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:47,053 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:47,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356467911] [2020-02-10 19:41:47,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:47,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:47,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115297226] [2020-02-10 19:41:47,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:47,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:47,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:47,064 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 19:41:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:47,286 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-02-10 19:41:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:47,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:47,302 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 19:41:47,302 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 19:41:47,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 19:41:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 19:41:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:41:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-02-10 19:41:47,521 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-02-10 19:41:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:47,521 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-02-10 19:41:47,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-02-10 19:41:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:47,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:47,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:47,526 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1320397242, now seen corresponding path program 579 times [2020-02-10 19:41:47,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:47,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795070215] [2020-02-10 19:41:47,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:48,063 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:48,191 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:48,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795070215] [2020-02-10 19:41:48,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:48,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:48,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13988533] [2020-02-10 19:41:48,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:48,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:48,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:48,201 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-02-10 19:41:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:48,459 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-02-10 19:41:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:48,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:48,474 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 19:41:48,475 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 19:41:48,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 19:41:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3126. [2020-02-10 19:41:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:41:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15567 transitions. [2020-02-10 19:41:48,684 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15567 transitions. Word has length 31 [2020-02-10 19:41:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:48,684 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15567 transitions. [2020-02-10 19:41:48,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15567 transitions. [2020-02-10 19:41:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:48,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:48,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:48,689 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1214517114, now seen corresponding path program 580 times [2020-02-10 19:41:48,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:48,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575203256] [2020-02-10 19:41:48,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:49,242 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:49,373 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:49,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575203256] [2020-02-10 19:41:49,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:49,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:49,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265467281] [2020-02-10 19:41:49,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:49,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:49,383 INFO L87 Difference]: Start difference. First operand 3126 states and 15567 transitions. Second operand 12 states. [2020-02-10 19:41:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:49,646 INFO L93 Difference]: Finished difference Result 5992 states and 26735 transitions. [2020-02-10 19:41:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:49,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:49,661 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 19:41:49,662 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 19:41:49,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 19:41:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 19:41:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:41:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15553 transitions. [2020-02-10 19:41:49,877 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15553 transitions. Word has length 31 [2020-02-10 19:41:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:49,877 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15553 transitions. [2020-02-10 19:41:49,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15553 transitions. [2020-02-10 19:41:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:49,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:49,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:49,883 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1218168134, now seen corresponding path program 581 times [2020-02-10 19:41:49,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:49,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940833737] [2020-02-10 19:41:49,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:50,433 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:50,608 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:50,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940833737] [2020-02-10 19:41:50,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:50,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:50,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390465674] [2020-02-10 19:41:50,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:50,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:50,618 INFO L87 Difference]: Start difference. First operand 3121 states and 15553 transitions. Second operand 12 states. [2020-02-10 19:41:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:50,836 INFO L93 Difference]: Finished difference Result 5993 states and 26738 transitions. [2020-02-10 19:41:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:50,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:50,851 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 19:41:50,851 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 19:41:50,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 19:41:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-02-10 19:41:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:41:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-02-10 19:41:51,066 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-02-10 19:41:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:51,066 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-02-10 19:41:51,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-02-10 19:41:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:51,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:51,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:51,071 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2063139586, now seen corresponding path program 582 times [2020-02-10 19:41:51,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:51,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103097263] [2020-02-10 19:41:51,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:51,610 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:51,747 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:51,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103097263] [2020-02-10 19:41:51,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:51,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:51,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654354201] [2020-02-10 19:41:51,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:51,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:51,757 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-02-10 19:41:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:52,023 INFO L93 Difference]: Finished difference Result 5994 states and 26734 transitions. [2020-02-10 19:41:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:52,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:52,038 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 19:41:52,038 INFO L226 Difference]: Without dead ends: 5965 [2020-02-10 19:41:52,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-02-10 19:41:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3116. [2020-02-10 19:41:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:41:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-02-10 19:41:52,253 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-02-10 19:41:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:52,253 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-02-10 19:41:52,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-02-10 19:41:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:52,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:52,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:52,259 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash -805894812, now seen corresponding path program 583 times [2020-02-10 19:41:52,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:52,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116728075] [2020-02-10 19:41:52,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:52,793 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:52,919 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:41:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:52,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116728075] [2020-02-10 19:41:52,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:52,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:52,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175918996] [2020-02-10 19:41:52,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:52,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:52,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:52,930 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-02-10 19:41:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:53,195 INFO L93 Difference]: Finished difference Result 5996 states and 26748 transitions. [2020-02-10 19:41:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:53,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:53,210 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 19:41:53,211 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 19:41:53,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 19:41:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-02-10 19:41:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:41:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-02-10 19:41:53,426 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-02-10 19:41:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:53,426 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-02-10 19:41:53,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-02-10 19:41:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:53,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:53,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:53,431 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:53,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1799129580, now seen corresponding path program 584 times [2020-02-10 19:41:53,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:53,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583290292] [2020-02-10 19:41:53,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:54,082 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:54,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583290292] [2020-02-10 19:41:54,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:54,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:54,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240944058] [2020-02-10 19:41:54,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:54,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:54,092 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-02-10 19:41:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:54,317 INFO L93 Difference]: Finished difference Result 5997 states and 26745 transitions. [2020-02-10 19:41:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:54,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:54,333 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 19:41:54,333 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 19:41:54,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 19:41:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3122. [2020-02-10 19:41:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:41:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 19:41:54,540 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 19:41:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:54,540 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 19:41:54,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 19:41:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:54,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:54,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:54,545 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:54,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:54,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1866672902, now seen corresponding path program 585 times [2020-02-10 19:41:54,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:54,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279886139] [2020-02-10 19:41:54,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:55,065 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:55,189 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:41:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:55,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279886139] [2020-02-10 19:41:55,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:55,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:55,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570940767] [2020-02-10 19:41:55,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:55,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:55,199 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 19:41:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:55,418 INFO L93 Difference]: Finished difference Result 6002 states and 26754 transitions. [2020-02-10 19:41:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:55,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:55,433 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 19:41:55,433 INFO L226 Difference]: Without dead ends: 5986 [2020-02-10 19:41:55,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-02-10 19:41:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3128. [2020-02-10 19:41:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:41:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-02-10 19:41:55,647 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-02-10 19:41:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:55,647 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-02-10 19:41:55,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-02-10 19:41:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:55,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:55,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:55,653 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:55,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:55,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1374077140, now seen corresponding path program 586 times [2020-02-10 19:41:55,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:55,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948125888] [2020-02-10 19:41:55,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:56,173 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2020-02-10 19:41:56,305 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:41:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:56,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948125888] [2020-02-10 19:41:56,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:56,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:56,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012559355] [2020-02-10 19:41:56,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:56,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:56,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:56,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:56,314 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-02-10 19:41:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:56,498 INFO L93 Difference]: Finished difference Result 6008 states and 26760 transitions. [2020-02-10 19:41:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:56,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:56,513 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 19:41:56,513 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 19:41:56,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 19:41:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3122. [2020-02-10 19:41:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:41:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 19:41:56,727 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 19:41:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:56,728 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 19:41:56,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 19:41:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:56,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:56,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:56,733 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash -110270982, now seen corresponding path program 587 times [2020-02-10 19:41:56,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:56,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173075978] [2020-02-10 19:41:56,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:57,260 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:41:57,388 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:57,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 19:41:57,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173075978] [2020-02-10 19:41:57,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:57,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:57,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904166873] [2020-02-10 19:41:57,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:57,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:57,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:57,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:57,398 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 19:41:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:57,706 INFO L93 Difference]: Finished difference Result 6005 states and 26755 transitions. [2020-02-10 19:41:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:57,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:57,722 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 19:41:57,722 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:41:57,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:41:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3129. [2020-02-10 19:41:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:41:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15563 transitions. [2020-02-10 19:41:57,936 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15563 transitions. Word has length 31 [2020-02-10 19:41:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:57,936 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15563 transitions. [2020-02-10 19:41:57,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15563 transitions. [2020-02-10 19:41:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:57,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:57,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:57,941 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2072267684, now seen corresponding path program 588 times [2020-02-10 19:41:57,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:57,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110488561] [2020-02-10 19:41:57,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:58,466 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:41:58,597 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:41:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:58,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110488561] [2020-02-10 19:41:58,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:58,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:58,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951001934] [2020-02-10 19:41:58,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:58,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:58,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:58,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:58,608 INFO L87 Difference]: Start difference. First operand 3129 states and 15563 transitions. Second operand 12 states. [2020-02-10 19:41:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:41:58,830 INFO L93 Difference]: Finished difference Result 6010 states and 26758 transitions. [2020-02-10 19:41:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:41:58,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:41:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:41:58,844 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 19:41:58,844 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 19:41:58,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:41:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 19:41:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3116. [2020-02-10 19:41:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:41:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15533 transitions. [2020-02-10 19:41:59,092 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15533 transitions. Word has length 31 [2020-02-10 19:41:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:41:59,093 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15533 transitions. [2020-02-10 19:41:59,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:41:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15533 transitions. [2020-02-10 19:41:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:41:59,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:41:59,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:41:59,098 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:41:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:41:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1498952476, now seen corresponding path program 589 times [2020-02-10 19:41:59,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:41:59,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456920070] [2020-02-10 19:41:59,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:41:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:41:59,619 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:41:59,748 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:41:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:41:59,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456920070] [2020-02-10 19:41:59,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:41:59,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:41:59,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323901563] [2020-02-10 19:41:59,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:41:59,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:41:59,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:41:59,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:41:59,759 INFO L87 Difference]: Start difference. First operand 3116 states and 15533 transitions. Second operand 12 states. [2020-02-10 19:42:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:00,017 INFO L93 Difference]: Finished difference Result 5999 states and 26749 transitions. [2020-02-10 19:42:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:00,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:00,032 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 19:42:00,032 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 19:42:00,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 19:42:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3127. [2020-02-10 19:42:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:42:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-02-10 19:42:00,255 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-02-10 19:42:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:00,255 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-02-10 19:42:00,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-02-10 19:42:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:00,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:00,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:00,261 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash 261100464, now seen corresponding path program 590 times [2020-02-10 19:42:00,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:00,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961078921] [2020-02-10 19:42:00,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:00,784 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:42:00,914 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:42:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:00,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961078921] [2020-02-10 19:42:00,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:00,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:00,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921590415] [2020-02-10 19:42:00,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:00,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:00,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:00,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:00,925 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-02-10 19:42:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:01,228 INFO L93 Difference]: Finished difference Result 6001 states and 26748 transitions. [2020-02-10 19:42:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:01,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:01,244 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 19:42:01,244 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 19:42:01,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 19:42:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3122. [2020-02-10 19:42:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:42:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 19:42:01,453 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 19:42:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:01,453 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 19:42:01,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 19:42:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:01,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42: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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:01,458 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:01,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:01,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2135419330, now seen corresponding path program 591 times [2020-02-10 19:42:01,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:01,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308923712] [2020-02-10 19:42:01,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:01,977 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:42:02,106 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:42:02,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 19:42:02,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308923712] [2020-02-10 19:42:02,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:02,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:02,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538525890] [2020-02-10 19:42:02,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:02,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:02,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:02,116 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 19:42:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:02,425 INFO L93 Difference]: Finished difference Result 6004 states and 26753 transitions. [2020-02-10 19:42:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:02,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:02,441 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 19:42:02,441 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 19:42:02,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 19:42:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 19:42:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:42:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15561 transitions. [2020-02-10 19:42:02,660 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15561 transitions. Word has length 31 [2020-02-10 19:42:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:02,660 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15561 transitions. [2020-02-10 19:42:02,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15561 transitions. [2020-02-10 19:42:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:02,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:02,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:02,665 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1642823568, now seen corresponding path program 592 times [2020-02-10 19:42:02,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:02,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596078435] [2020-02-10 19:42:02,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:03,205 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:42:03,332 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:42:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:03,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596078435] [2020-02-10 19:42:03,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:03,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:03,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734910284] [2020-02-10 19:42:03,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:03,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:03,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:03,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:03,342 INFO L87 Difference]: Start difference. First operand 3128 states and 15561 transitions. Second operand 12 states. [2020-02-10 19:42:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:03,550 INFO L93 Difference]: Finished difference Result 6010 states and 26759 transitions. [2020-02-10 19:42:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:03,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:03,565 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 19:42:03,565 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 19:42:03,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 19:42:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 19:42:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 19:42:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15544 transitions. [2020-02-10 19:42:03,779 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15544 transitions. Word has length 31 [2020-02-10 19:42:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:03,779 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15544 transitions. [2020-02-10 19:42:03,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15544 transitions. [2020-02-10 19:42:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:03,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:03,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:03,785 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1648300098, now seen corresponding path program 593 times [2020-02-10 19:42:03,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:03,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780116170] [2020-02-10 19:42:03,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:04,314 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:42:04,443 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:42:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:04,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780116170] [2020-02-10 19:42:04,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:04,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:04,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317993620] [2020-02-10 19:42:04,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:04,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:04,453 INFO L87 Difference]: Start difference. First operand 3122 states and 15544 transitions. Second operand 12 states. [2020-02-10 19:42:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:04,697 INFO L93 Difference]: Finished difference Result 6010 states and 26761 transitions. [2020-02-10 19:42:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:04,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:04,712 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 19:42:04,712 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 19:42:04,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 19:42:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3130. [2020-02-10 19:42:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:42:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15559 transitions. [2020-02-10 19:42:04,927 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15559 transitions. Word has length 31 [2020-02-10 19:42:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:04,927 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15559 transitions. [2020-02-10 19:42:04,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15559 transitions. [2020-02-10 19:42:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:04,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:04,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:04,932 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1379210020, now seen corresponding path program 594 times [2020-02-10 19:42:04,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:04,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516753408] [2020-02-10 19:42:04,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:05,475 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:42:05,608 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 19:42:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:05,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516753408] [2020-02-10 19:42:05,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:05,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:05,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563826651] [2020-02-10 19:42:05,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:05,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:05,618 INFO L87 Difference]: Start difference. First operand 3130 states and 15559 transitions. Second operand 12 states. [2020-02-10 19:42:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:05,808 INFO L93 Difference]: Finished difference Result 6014 states and 26761 transitions. [2020-02-10 19:42:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:05,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:05,822 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 19:42:05,822 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 19:42:05,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 19:42:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3116. [2020-02-10 19:42:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 19:42:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15527 transitions. [2020-02-10 19:42:06,038 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15527 transitions. Word has length 31 [2020-02-10 19:42:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:06,038 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15527 transitions. [2020-02-10 19:42:06,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15527 transitions. [2020-02-10 19:42:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:06,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:06,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:06,044 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash -280043412, now seen corresponding path program 595 times [2020-02-10 19:42:06,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:06,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990937819] [2020-02-10 19:42:06,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:06,594 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:42:06,730 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:42:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:06,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990937819] [2020-02-10 19:42:06,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:06,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:06,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735547586] [2020-02-10 19:42:06,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:06,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:06,741 INFO L87 Difference]: Start difference. First operand 3116 states and 15527 transitions. Second operand 12 states. [2020-02-10 19:42:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:06,984 INFO L93 Difference]: Finished difference Result 6006 states and 26762 transitions. [2020-02-10 19:42:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:06,984 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:06,999 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 19:42:06,999 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 19:42:06,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 19:42:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3129. [2020-02-10 19:42:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 19:42:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15564 transitions. [2020-02-10 19:42:07,214 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15564 transitions. Word has length 31 [2020-02-10 19:42:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:07,214 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15564 transitions. [2020-02-10 19:42:07,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15564 transitions. [2020-02-10 19:42:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:07,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:07,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:07,220 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:07,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1125014864, now seen corresponding path program 596 times [2020-02-10 19:42:07,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:07,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046708656] [2020-02-10 19:42:07,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:07,594 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-02-10 19:42:07,941 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:42:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:07,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046708656] [2020-02-10 19:42:07,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:07,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:07,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979682457] [2020-02-10 19:42:07,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:07,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:07,952 INFO L87 Difference]: Start difference. First operand 3129 states and 15564 transitions. Second operand 12 states. [2020-02-10 19:42:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:08,176 INFO L93 Difference]: Finished difference Result 6007 states and 26758 transitions. [2020-02-10 19:42:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:08,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:08,191 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 19:42:08,192 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 19:42:08,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 19:42:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3123. [2020-02-10 19:42:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:42:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15547 transitions. [2020-02-10 19:42:08,404 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15547 transitions. Word has length 31 [2020-02-10 19:42:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:08,404 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15547 transitions. [2020-02-10 19:42:08,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15547 transitions. [2020-02-10 19:42:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:08,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:08,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:08,409 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:08,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash -916510266, now seen corresponding path program 597 times [2020-02-10 19:42:08,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:08,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121077308] [2020-02-10 19:42:08,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:09,059 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:42:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:09,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121077308] [2020-02-10 19:42:09,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:09,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:09,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410178428] [2020-02-10 19:42:09,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:09,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:09,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:09,069 INFO L87 Difference]: Start difference. First operand 3123 states and 15547 transitions. Second operand 12 states. [2020-02-10 19:42:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:09,334 INFO L93 Difference]: Finished difference Result 6011 states and 26765 transitions. [2020-02-10 19:42:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:09,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:09,349 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 19:42:09,349 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 19:42:09,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 19:42:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3130. [2020-02-10 19:42:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:42:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15560 transitions. [2020-02-10 19:42:09,559 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15560 transitions. Word has length 31 [2020-02-10 19:42:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:09,559 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15560 transitions. [2020-02-10 19:42:09,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15560 transitions. [2020-02-10 19:42:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:09,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:09,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:09,565 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1266028400, now seen corresponding path program 598 times [2020-02-10 19:42:09,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:09,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273455673] [2020-02-10 19:42:09,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:10,096 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:42:10,223 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:42:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:10,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273455673] [2020-02-10 19:42:10,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:10,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:10,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793185707] [2020-02-10 19:42:10,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:10,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:10,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:10,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:10,234 INFO L87 Difference]: Start difference. First operand 3130 states and 15560 transitions. Second operand 12 states. [2020-02-10 19:42:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:10,487 INFO L93 Difference]: Finished difference Result 6016 states and 26768 transitions. [2020-02-10 19:42:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:10,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:10,502 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 19:42:10,502 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 19:42:10,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 19:42:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3123. [2020-02-10 19:42:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 19:42:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15540 transitions. [2020-02-10 19:42:10,717 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15540 transitions. Word has length 31 [2020-02-10 19:42:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:10,717 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15540 transitions. [2020-02-10 19:42:10,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15540 transitions. [2020-02-10 19:42:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:10,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:10,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, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:10,722 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:10,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2109174342, now seen corresponding path program 599 times [2020-02-10 19:42:10,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:10,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556590629] [2020-02-10 19:42:10,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:11,256 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:42:11,388 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:42:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:11,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556590629] [2020-02-10 19:42:11,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:11,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:11,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032559044] [2020-02-10 19:42:11,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:11,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:11,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:11,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:11,399 INFO L87 Difference]: Start difference. First operand 3123 states and 15540 transitions. Second operand 12 states. [2020-02-10 19:42:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:42:11,695 INFO L93 Difference]: Finished difference Result 6014 states and 26765 transitions. [2020-02-10 19:42:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:42:11,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:42:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:42:11,711 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 19:42:11,711 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 19:42:11,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:42:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 19:42:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3131. [2020-02-10 19:42:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:42:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15555 transitions. [2020-02-10 19:42:11,917 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15555 transitions. Word has length 31 [2020-02-10 19:42:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:42:11,918 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15555 transitions. [2020-02-10 19:42:11,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:42:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15555 transitions. [2020-02-10 19:42:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:42:11,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:42:11,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:42:11,923 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:42:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:42:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash 841717164, now seen corresponding path program 600 times [2020-02-10 19:42:11,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:42:11,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469117436] [2020-02-10 19:42:11,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:42:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:42:12,475 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:42:12,607 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:42:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:42:12,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469117436] [2020-02-10 19:42:12,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:42:12,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:42:12,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158197316] [2020-02-10 19:42:12,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:42:12,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:42:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:42:12,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:42:12,617 INFO L87 Difference]: Start difference. First operand 3131 states and 15555 transitions. Second operand 12 states. Received shutdown request... [2020-02-10 19:42:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:42:12,714 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 19:42:12,719 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 19:42:12,719 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:42:12 BasicIcfg [2020-02-10 19:42:12,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:42:12,720 INFO L168 Benchmark]: Toolchain (without parser) took 771734.93 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 119.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2020-02-10 19:42:12,720 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.43 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-02-10 19:42:12,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.74 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 117.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-02-10 19:42:12,721 INFO L168 Benchmark]: Boogie Preprocessor took 27.90 ms. Allocated memory is still 144.7 MB. Free memory was 117.8 MB in the beginning and 116.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 19:42:12,721 INFO L168 Benchmark]: RCFGBuilder took 431.86 ms. Allocated memory is still 144.7 MB. Free memory was 116.5 MB in the beginning and 101.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-02-10 19:42:12,721 INFO L168 Benchmark]: TraceAbstraction took 771231.51 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2020-02-10 19:42:12,722 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 1.43 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.74 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 117.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.90 ms. Allocated memory is still 144.7 MB. Free memory was 117.8 MB in the beginning and 116.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 431.86 ms. Allocated memory is still 144.7 MB. Free memory was 116.5 MB in the beginning and 101.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 771231.51 ms. Allocated memory was 144.7 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.2s, 84 ProgramPointsBefore, 73 ProgramPointsAfterwards, 143 TransitionsBefore, 132 TransitionsAfterwards, 3780 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 990 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1035 CheckedPairsTotal, 11 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 33). Cancelled while BasicCegarLoop was constructing difference of abstraction (3131states) and FLOYD_HOARE automaton (currently 6 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 770.9s, OverallIterations: 609, TraceHistogramMax: 1, AutomataDifference: 170.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.3s, HoareTripleCheckerStatistics: 92380 SDtfs, 138232 SDslu, 260032 SDs, 0 SdLazy, 69449 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7226 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 6608 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4800 ImplicationChecksByTransitivity, 446.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60074occurred 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: 155.8s AutomataMinimizationTime, 608 MinimizatonAttempts, 1725759 StatesRemovedByMinimization, 599 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 411.3s InterpolantComputationTime, 18879 NumberOfCodeBlocks, 18879 NumberOfCodeBlocksAsserted, 609 NumberOfCheckSat, 18270 ConstructedInterpolants, 0 QuantifiedInterpolants, 22737540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 609 InterpolantComputations, 609 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